Regularity Conditions and Optimality in Vector Optimization
Authors:
- 1 January 2004
- journal article
- Published by Taylor & Francis in Numerical Functional Analysis and Optimization
- Vol. 25 (5-6) , 479-501
Abstract
The aim of this article is to study necessary optimality conditions for a vector minimization program involving locally Lipschitz functions under certain general regularity conditions. We study problems involving only inequality and both inequality and equality constraints.Keywords
This publication has 14 references indexed in Scilit:
- Proper Efficiency and Generalized Convexity in Nonsmooth Vector Optimization Problems2001
- Constraint Qualifications in Nonsmooth Multiobjective OptimizationJournal of Optimization Theory and Applications, 2000
- Multicriteria Optimization2000
- Characterizations of strict local minima for some nonlinear programming problemsNonlinear Analysis, 1997
- Constraint qualifications in multiobjective optimization problems: Differentiable caseJournal of Optimization Theory and Applications, 1994
- Characterization of nonsmooth functions through their generalized gradientsOptimization, 1991
- Theory of Vector Optimization1989
- Convexlike alternative theorems and mathematical programmingOptimization, 1985
- Necessary conditions for optimality of nondifferentiable convex multiobjective programmingJournal of Optimization Theory and Applications, 1983
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach SpaceSIAM Journal on Control, 1969