Robustness of posynomial geometric programming optima

DOI10.1007/S101070050065MaRDI QIDQ1300280zbMATH OpenOpenAlexFDO

Authors A. J. Federowicz, Jayant Rajgopal

Publication date 9 February 2001

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

geometric programmingpolynomialssensitivity analysis

Mathematics Subject Classification ID

Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• Posynomial geometric programming with parametric uncertainty
• Posynomial geometric programming with interval exponents and coefficients
• Tractable approximate robust geometric programming
• Sensitivity analysis in posynomial geometric programming
• Controlled dual perturbations for posynomial programs

Cited in

(7)

• A tutorial on geometric programming
• Minimization of certain cost functions with error bounds
• A geometric branch and bound method for robust maximization of convex functions
• On the complexity of robust geometric programming with polyhedral uncertainty
• Posynomial geometric programming with interval exponents and coefficients
• Posynomial geometric programming with parametric uncertainty
• Tractable approximate robust geometric programming

This page was built for publication: Robustness of posynomial geometric programming optima

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1300280)