Sensitivity Analysis on the Negative Degree of Difficulty Geometric Programming Problem

• 作者: C. Igboanusi D. E. Onwuegbuchunam H. O. Amuji N. P. Olewuezi
• 来源期刊: 美国运筹学期刊(英文)
• 学科: 数学
• 关键词: NEGATIVE DEGREE of DIFFICULTY Sensitivity Analysis Primal DECISION VARIABLES Dual DECISION VARIABLES Global Optimal Solution
• 年，卷（期）: 2020,（1）
• 页码范围: 13-23
• 页数: 11页
• 分类号: O17

摘要

The range of optimal values in cost optimization models provides management with options for decision making. However, it can be quite challenging to achieve feasible range of optimality in Geometric programming (Gp) models having negative degrees of difficulty. In this paper, we conduct sensitivity analysis on the optimal solution of Geometric programming problem with negative degree of difficulty. Using imprest data, we determine the optimal objective function, dual decision variables, primal decision variables;the range of values, the cost coefficient and RHS constraint must lie for the solution to stay optimal. From the analysis, we established that incremental sensitivity analysis has the functional form .