Lexicographic geometric programming

DOI10.1016/0377-2217(91)90255-TMaRDI QIDQ1179204zbMATH OpenFDO

Authors František Turnovec, Mikulas Luptacik

Publication date 26 June 1992

Published in European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Lagrange multipliersdualityconvex lexicographic programmingKuhn-Tucker type optimality conditionslexicographical geometric programminglexicographical maximization problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Duality theory (optimization) (49N15)

Recommendations

• Lexicographical order and duality in multiobjective programming
• scientific article; zbMATH DE number 3898622
• scientific article; zbMATH DE number 729978
• scientific article; zbMATH DE number 1163120
• scientific article; zbMATH DE number 1069097

Cites work

• scientific article; zbMATH DE number 3121281 (Why is no real title available?)
• scientific article; zbMATH DE number 3746762 (Why is no real title available?)
• scientific article; zbMATH DE number 3516877 (Why is no real title available?)
• scientific article; zbMATH DE number 3537446 (Why is no real title available?)
• scientific article; zbMATH DE number 3272827 (Why is no real title available?)
• An approach to nonlinear programming
• Geometric programming. Method and applications
• Lexicographic quasiconcave multiobjective programming
• Lexicographical order and duality in multiobjective programming
• Linear lexicographic optimization

Cited in

(1)

• Characterizations of efficient solutions under polyhedrality assumptions

This page was built for publication: Lexicographic geometric programming

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