Approximate Saddle Point and Duality for Multiobjective n-Set Optimization

DOI10.1081/NFA-120023863MaRDI QIDQ4435180zbMATH OpenOpenAlexFDO

Authors Davinder Bhatia, Aparna Mehra

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)

Recommendations

• Saddle point criteria and duality in multiobjective programming via an η-approximation method
• Saddle points optimality criteria and duality for multi-objective E-convex programming problems
• Approximate Lagrangian duality and saddle point optimality in set optimization
• Saddle point and generalized convex duality for multiobjective programming.
• Lagrange duality and saddle points theorem for multiobjective semidefinite programming
• scientific article; zbMATH DE number 4095229
• scientific article; zbMATH DE number 2159098
• Optimality and mixed saddle point criteria in multiobjective optimization
• Generalized saddle points in multi-objective bilinear programming
• Publication:3468900

Cites work

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

Cited in

(6)

• Approximate saddle-point theorems in vector optimization
• Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
• scientific article; zbMATH DE number 6501087 (Why is no real title available?)
• scientific article; zbMATH DE number 2159098 (Why is no real title available?)
• Saddle points criteria in nondifferentiable multiobjective programming with \(V\)-invex functions via an \(\eta \)-approximation method
• Approximating the nondominated set of an MOLP by approximately solving its dual problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4435180)