Sensitivity analysis in geometric programming: Theory and computations

This paper surveys the main developments the area of sensitivity analysis for geometric programming problems, including both the theoretical and computational aspects. It presents results which characterize solution existence, continuity, and differentiability properties for primal and dual geometric programs as well as the optimal value function differentiability properties for primal and dual programs. It also provides an overview of main computational approaches to sensitivity analysis in geometric programming which attempt to estimate new optimal solutions resulting from perturbations in some problem parameters.