A converse duality theorem in multiple objective programming

DOI10.1016/0167-6377(87)90025-3zbMath0641.90074OpenAlexW1984987987MaRDI QIDQ1101016

T. Weir

Publication date: 1987

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(87)90025-3

zbMATH Keywords

converse dualitydifferentiable programmingWolfe's duality

Mathematics Subject Classification ID

Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Numerical methods based on nonlinear programming (49M37) Duality theory (optimization) (49N15)

Related Items (4)

Generalized convexity and duality for multiobjective optimization problems ⋮ Mixed type converse duality in multiobjective programming problems ⋮ SUFFICIENT OPTIMALITY CONDITIONS AND DUALITY IN MULTIOBJECTIVE OPTIMIZATION INVOLVING GENERALIZED CONVEXITY ⋮ Optimality Conditions and Duality Theorems for Multiobjective Invex Programs

Cites Work

• Proper efficiency and the theory of vector maximization
• A duality theorem for non-linear programming
• Lagrangean conditions and quasiduality
• Technical Note—On Converse Duality in Nonlinear Programming
• Unnamed Item

This page was built for publication: A converse duality theorem in multiple objective programming