A modified wolfe dual for weak vector minimization
- 1 January 1989
- journal article
- research article
- Published by Taylor & Francis in Numerical Functional Analysis and Optimization
- Vol. 10 (9-10) , 899-907
- https://doi.org/10.1080/01630568908816337
Abstract
A version of the Wolfe dual problem is constructed for constained weak minimization of a vector objective function, in finite or infinite dimensions (e.g. continuous programming) The usual convex requirements are weakened to invex. Weak duality is replaced by an inclusion, constructed using the cone defining the weak minimum. Relations with Pareto (or proper Pareto) minima are discussed.Keywords
This publication has 8 references indexed in Scilit:
- Weak minimization and dualityNumerical Functional Analysis and Optimization, 1987
- On duality for weakly minimized vector valued optimization problemsOptimization, 1986
- Nondifferentiable optimization by smooth approximationsOptimization, 1986
- Invex functions and dualityJournal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, 1985
- Mathematical Programming and Control TheoryPublished by Springer Nature ,1978
- Lagrangean conditions and quasidualityBulletin of the Australian Mathematical Society, 1977
- Sufficient Fritz John optimality conditions for nondifferentiable convex programmingThe Journal of the Australian Mathematical Society. Series B. Applied Mathematics, 1976
- Proper efficiency and the theory of vector maximizationJournal of Mathematical Analysis and Applications, 1968