Axiomatic approach to duality in optimization
- 1 January 1992
- journal article
- research article
- Published by Taylor & Francis in Numerical Functional Analysis and Optimization
- Vol. 13 (3) , 305-326
- https://doi.org/10.1080/01630569208816480
Abstract
A new approach to duality in mathematical programming is developed for nonconvex vector problems with set-valued objectives. The approach is based on a weak duality axiom and a separation of nonconvex sets by means of monotonic functions. Strong duality results are obtained without convexity assumptions and without or under a rather weak constraint qualification. An application to nonconvex scalar programming is supplied.Keywords
This publication has 19 references indexed in Scilit:
- Existence and Lagrangian duality for maximizations of set-valued functionsJournal of Optimization Theory and Applications, 1987
- About duality and alternative in multiobjective optimizationJournal of Optimization Theory and Applications, 1987
- Duality theorem of nondifferentiable convex multiobjective programmingJournal of Optimization Theory and Applications, 1986
- On duality theory in multiobjective programmingJournal of Optimization Theory and Applications, 1984
- Duality in vector optimizationMathematical Programming, 1983
- Adjoint Process DualityMathematics of Operations Research, 1983
- Proper efficiency with respect to conesJournal of Optimization Theory and Applications, 1982
- A Duality Theorem in Multiobjective Nonlinear ProgrammingMathematics of Operations Research, 1982
- Duality theory for maximizations with respect to conesJournal of Mathematical Analysis and Applications, 1981
- Duality for nonlinear multiple-criteria optimization problemsJournal of Optimization Theory and Applications, 1981