Lagrange multipliers saddle points and scalarizations in composite multiobjective nonsmooth programming
Author:
- 1 January 1996
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 38 (2) , 93-105
Abstract
A Lagrange multiplier theorem is established for a nonsmooth constrained multiobjective optimizatioi problems where the objective function and the constraints are compositions of F-invex functions, anc locally Lipschitz and Gateaux differentiable functions. Furthermore, a vector valued Lagrangian is intro duced and vector valued saddle point results are presented. A scalarization result and a characterizatior of the set of all conditionally properly efficient solutions for V-invex composite problems are alsc discussed under appropriate conditions.Keywords
This publication has 16 references indexed in Scilit:
- Generalized convex composite multi-objective nonsmooth programming and conditional proper efficiencyOptimization, 1995
- Duality for minmax programming involvingV-invex functionsOptimization, 1994
- On generalised convex mathematical programmingThe Journal of the Australian Mathematical Society. Series B. Applied Mathematics, 1992
- Quasimin and quasisaddlepoint for vector optimizationNumerical Functional Analysis and Optimization, 1990
- Some minimax problems of vector-valued functionsJournal of Optimization Theory and Applications, 1988
- A simple characterization of solution sets of convex programsOperations Research Letters, 1988
- Weak minimization and dualityNumerical Functional Analysis and Optimization, 1987
- On Duality for Weakly Minimized Vector Valued Optimization ProblemsOptimization, 1986
- Vector and Parametric ProgrammingJournal of the Operational Research Society, 1985
- Proper efficiency with respect to conesJournal of Optimization Theory and Applications, 1982