eduzhai > Physical Sciences > Physics Sciences >

Sensitivity Analysis on the Negative Degree of Difficulty Geometric Programming Problem

  • Save

... pages left unread,continue reading

Document pages: 11 pages

Abstract: 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 .

Please select stars to rate!

         

0 comments Sign in to leave a comment.

    Data loading, please wait...
×