Higher Order Efficiency, Saddle Point Optimality, and Duality for Vector Optimization Problems

DOI10.1080/01630560701249970zbMath1127.90061OpenAlexW2167456648MaRDI QIDQ3444669

Davinder Bhatia, Anjana Gupta, Aparna Mehra

Publication date: 4 June 2007

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630560701249970

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)

Related Items (4)

Necessary and sufficient conditions for a Pareto optimal allocation in a discontinuous Gale economic model ⋮ Characterizing strict efficiency for convex multiobjective programming problems ⋮ Higher-order conditions for strict local Pareto minima in terms of generalized lower and upper directional derivatives ⋮ Sufficiency and duality in nondifferentiable multiobjective programming involving higher order strong invexity

Cites Work

• Theory of multiobjective optimization
• Characterizations of strict local minima and necessary conditions for weak sharp minima
• On the notion of proper efficiency in vector optimization
• Lagrange multipliers and saddle points in multiobjective programming
• A saddle-point characterization of Pareto optima
• Some exact penalty results for nonlinear programs and mathematical programs with equilibrium constraints
• Strict minimality conditions in nondifferentiable multiobjective programming
• Stability in Mathematical Programming with Nondifferentiable Data
• Convexlike alternative theorems and mathematical programming
• Necessary and Sufficient Conditions for Isolated Local Minima of Nonsmooth Functions
• Scalarization and lagrange duality in multiobjective optimization
• Regularity Conditions and Optimality in Vector Optimization
• Strict efficiency in vector optimization
• Unnamed Item

This page was built for publication: Higher Order Efficiency, Saddle Point Optimality, and Duality for Vector Optimization Problems