On a compound duality classification for geometric programming

DOI10.1007/S10957-018-1415-1MaRDI QIDQ1730762zbMATH OpenOpenAlexWikidataFDO

Authors Qinghong Zhang, K. Kortanek

Publication date 6 March 2019

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

Full work available at URL https://doi.org/10.1007/s10957-018-1415-1

zbMATH Keywords

classification theoryduality resultsgeometric programming

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• An alternative approach to the refined duality theory of geometric programming
• The fundamental relations between geometric programming duality, parametric programming duality, and ordinary Lagrangian duality
• Composite geometric programming
• On the duality of generalized geometric programming
• scientific article; zbMATH DE number 3971598

Cites work

• Classifying convex extremum problems over linear topologies having separation properties
• Constraint Sets of Geometric Programs Characterized by Auxiliary Problems
• Convex Analysis
• scientific article; zbMATH DE number 3272827 (Why is no real title available?)
• scientific article; zbMATH DE number 3420479 (Why is no real title available?)
• On a classification scheme for geometric programming and complementarity theorems†^†
• Proving strong duality for geometric optimization using a conic formulation

Cited in

(3)

• An alternative approach to the refined duality theory of geometric programming
• scientific article; zbMATH DE number 4131969 (Why is no real title available?)
• Robust chance-constrained geometric programming with application to demand risk mitigation

This page was built for publication: On a compound duality classification for geometric programming

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