Sensitivity analysis in posynomial geometric programming
From MaRDI portal
Publication:1090245
DOI10.1007/BF00939331zbMath0619.90071MaRDI QIDQ1090245
Publication date: 1988
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Duality theory (optimization) (49N15) Mathematical programming (90C99)
Related Items (4)
Temperature-aware floorplanning via geometric programming ⋮ Sensitivity analysis in geometric programming: Theory and computations ⋮ A tutorial on geometric programming ⋮ Global multi-parametric optimal value bounds and solution estimates for separable parametric programs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sensitivity analysis in geometric programming
- Dual to primal conversion in geometric programming
- Solution point differentiability without strict complementarity in nonlinear programming
- Strongly Regular Generalized Equations
- 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
- Sensitivity Analysis Procedures for Geometric Programs: Computational Aspects
- An implementation of some implicit function theorems with applications to sensitivity analysis
- Trajectory analysis and extrapolation in barrier function methods
- Jacobians in Constrained Nonlinear Optimization
- Substitution Effects in Geometric Programming
This page was built for publication: Sensitivity analysis in posynomial geometric programming