Sensitivity analysis in posynomial geometric programming
From MaRDI portal
Sensitivity analysis results for general parametric posynomial geometric programs are obtained by utilizing the recent results from nonlinear programming. Duality theory of geometric programming is exploited to relate the sensitivity results derived for primal and dual geometric programs. The computational aspects of sensitivity calculations are also considered.
Recommendations
Cites work
- An implementation of some implicit function theorems with applications to sensitivity analysis
- Dual to primal conversion in geometric programming
- scientific article; zbMATH DE number 3689175 (Why is no real title available?)
- scientific article; zbMATH DE number 3532744 (Why is no real title available?)
- scientific article; zbMATH DE number 3301979 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- Implicit function theorems for mathematical programming and for systems of inequalities
- Jacobians in Constrained Nonlinear Optimization
- Sensitivity analysis for nonlinear programming using penalty methods
- Sensitivity analysis in geometric programming
- Sensitivity Analysis Procedures for Geometric Programs: Computational Aspects
- Solution point differentiability without strict complementarity in nonlinear programming
- Strongly Regular Generalized Equations
- Substitution Effects in Geometric Programming
- Technical Note—On Sensitivity Analysis in Geometric Programming
- Trajectory analysis and extrapolation in barrier function methods
Cited in
(10)- A tutorial on geometric programming
- Robustness of posynomial geometric programming optima
- Sensitivity and parametric bound analysis for a single pass machining problem
- Sensitivity analysis in geometric programming: Theory and computations
- A general parametric analysis approach and its implication to sensitivity analysis in interior point methods
- A geometric characterization of sensitivity analysis in monomial models
- An Interval Arithmetic Approach to Sensitivity Analysis in Geometric Programming
- Sensitivity analysis of discrete preference functions using Koszul simplicial complexes
- Global multi-parametric optimal value bounds and solution estimates for separable parametric programs
- Temperature-aware floorplanning via geometric programming
This page was built for publication: Sensitivity analysis in posynomial geometric programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1090245)
