Sensitivity analysis in geometric programming

DOI10.1007/BF00934363zbMath0458.90065OpenAlexW2046885415MaRDI QIDQ1151832

Ron S. Dembo

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1007/bf00934363

zbMATH Keywords

sensitivity analysisunique solutionsensitivity equationsapproximation of derivativesuniqueness conditionscomputation of first-order derivativescomputation of higher-order derivativessufficiently smooth nonlinear program

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Mathematical programming (90C99)

Related Items

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 ⋮ A tutorial on geometric programming

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

This page was built for publication: Sensitivity analysis in geometric programming