Lexicographic geometric programming

DOI10.1016/0377-2217(91)90255-TzbMath0746.90059MaRDI QIDQ1179204

F. 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)

Related Items (1)

Characterizations of efficient solutions under polyhedrality assumptions

Cites Work

• Lexicographical order and duality in multiobjective programming
• Geometric programming. Method and applications
• Linear lexicographic optimization
• An approach to nonlinear programming
• Lexicographic quasiconcave multiobjective programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lexicographic geometric programming