Sensitivity analysis in geometric programming

DOI10.1007/BF00934363zbMath0458.90065MaRDI QIDQ1151832

Ron S. Dembo

Publication date: 1982

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

sensitivity analysis; unique solution; sensitivity equations; approximation of derivatives; uniqueness conditions; computation of first-order derivatives; computation of higher-order derivatives; sufficiently smooth nonlinear program

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C30: Nonlinear programming

90C31: Sensitivity, stability, parametric optimization

90C99: Mathematical programming

Related Items

A tutorial on geometric programming, Sensitivity analysis in posynomial geometric programming, Second-order sensitivity analysis in factorable programming: Theory and applications, Optimal production and marketing planning, Sensitivity analysis in geometric programming: Theory and computations

Cites Work

• Unnamed Item
• Unnamed Item
• Dual to primal conversion in geometric programming
• Second order algorithms for the posynomial geometric programming dual, part I: Analysis
• The Generic Nature of Optimality Conditions in Nonlinear Programming
• Constrained Entropy Models; Solvability and Sensitivity
• Implicit function theorems for mathematical programming and for systems of inequalities
• Sensitivity analysis for nonlinear programming using penalty methods
• Technical Note—On Sensitivity Analysis in Geometric Programming
• Computational experience in sensitivity analysis for nonlinear programming