Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems

DOI10.1007/s40305-015-0075-1zbMath1317.90272OpenAlexW2054697780MaRDI QIDQ2356347

Ying Gao, Rui-Xue Yue

Publication date: 29 July 2015

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-015-0075-1

zbMATH Keywords

multiobjective optimization problemsapproximate quasi efficeint solutionsnonlinear scalarizations

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonlinear programming (90C30)

Related Items (2)

Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization ⋮ Approximate proper efficiency for multiobjective optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimality conditions for approximate solutions of vector optimization problems
• Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems
• Ekeland's variational principle in locally convex spaces and the density of extremal points
• A generalized Ekeland vector variational principle and its applications in optimization
• Generating \(\varepsilon\)-efficient solutions in multiobjective programming
• On approximate efficiency in multiobjective programming
• Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions
• Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
• Improved \(\varepsilon\)-constraint method for multiobjective programming
• \(\epsilon\)-solutions in vector minimization problems
• Epsilon efficiency
• General Ekeland's variational principle for set-valued mappings.
• Scalarizing vector optimization problems
• Existence and optimality conditions for approximate solutions to vector optimization problems
• Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
• An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces^∗
• ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
• Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization
• Two Types of Approximate Saddle Points
• A Set-Valued Ekeland's Variational Principle in Vector Optimization
• Necessary conditions for ε-optimality
• On lagrange-kuhn-tucker multipliers for pareto optimization problems
• On Lagrance-Kuhn-Tucker Mulitipliers for Muliobjective Optimization Problems
• OPTIMALITY CONDITIONS AND APPROXIMATE OPTIMALITY CONDITIONS IN LOCALLY LIPSCHITZ VECTOR OPTIMIZATION
• A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems

This page was built for publication: Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems