Publication:4544323
From MaRDI portal
zbMath1010.90073MaRDI QIDQ4544323
Bienvenido Jiménez, Vicente Novo Sanjurjo
Publication date: 4 September 2002
Lagrange multipliers; multiobjective programming; alternative theorems; necessary conditions for Pareto minimum
90C29: Multi-objective and goal programming
90C46: Optimality conditions and duality in mathematical programming
Related Items
First-order necessary conditions in locally Lipschitz multiobjective optimization, ϵ-Efficient solutions in semi-infinite multiobjective optimization, On constraint qualifications in directionally differentiable multiobjective optimization problems, Constraint qualifications in nonsmooth multiobjective optimization problem, Karush-Kuhn-Tucker Optimality Conditions and Duality for Multiobjective Semi-Infinite Programming Via Tangential Subdifferentials, Dini and Hadamard directional derivatives in multiobjective optimization: an overview of some results, On directionally differentiable multiobjective programming problems with vanishing constraints, Nonsmooth multiobjective programming: strong Kuhn-Tucker conditions, Strong Kuhn-Tucker conditions and constraint qualifications in locally Lipschitz multiobjective optimization problems, On the functions with pseudoconvex sublevel sets and optimality conditions, On Abadie constraint qualification for multiobjective optimization problems, Infinite-horizon multiobjective optimal control problems for bounded processes, On approximate Karush-Kuhn-Tucker conditions for multiobjective optimization problems, On Tucker-type alternative theorems and necessary optimality conditions for nonsmooth multiobjective optimization, On the Mangasarian-Fromovitz constraint qualification and Karush-Kuhn-Tucker conditions in nonsmooth semi-infinite multiobjective programming, An extension of the basic constraint qualification to nonconvex vector optimization problems, Scalarization in geometric and functional vector optimization revisited, KKT conditions for weak\(^\ast\) compact convex sets, theorems of the alternative, and optimality conditions, A chain rule for \(\varepsilon\)-subdifferentials with applications to approximate solutions in convex Pareto problems
