Approximate Saddle Point and Duality for Multiobjective n-Set Optimization

DOI10.1081/NFA-120023863zbMath1097.90044OpenAlexW2090548076MaRDI QIDQ4435180

Aparna Mehra, Davinder Bhatia

Publication date: 26 November 2003

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

Full work available at URL: https://doi.org/10.1081/nfa-120023863

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

• Optimality of differentiable, vector-valued n-set functions
• Optimization theory for n-set functions
• Optimal constrained selection of a measurable subset
• \(\epsilon\)-solutions in vector minimization problems
• On multiple objective programming problems with set functions
• Epsilon efficiency
• Proper D-solutions of multiobjective programming problems with set functions
• Lagrange multiplier theorem of multiobjective programming problems with set functions
• Efficiency and duality for nonlinear multiobjective programs involving \(n\)-set functions
• Approximate saddle-point theorems in vector optimization
• \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
• An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces^∗
• ε-Optimal solutions in nondifferentiable convex programming and some related questions
• Saddle point and duality in the optimization theory of convex set functions
• ε-approximate solutions in multiobjective optimization

This page was built for publication: Approximate Saddle Point and Duality for Multiobjective n-Set Optimization