On a compound duality classification for geometric programming

DOI10.1007/s10957-018-1415-1zbMath1409.90220OpenAlexW2898203909WikidataQ129026165 ScholiaQ129026165MaRDI QIDQ1730762

Qinghong Zhang, Kenneth O. 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

geometric programmingduality resultsclassification theory

Mathematics Subject Classification ID

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

Related Items (1)

Robust chance-constrained geometric programming with application to demand risk mitigation

Cites Work

• Unnamed Item
• Unnamed Item
• Classifying convex extremum problems over linear topologies having separation properties
• Constraint Sets of Geometric Programs Characterized by Auxiliary Problems
• On a classification scheme for geometric programming and complementarity theorems†^†
• Convex Analysis
• Proving strong duality for geometric optimization using a conic formulation

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