Characterizing ϵ-properly efficient solutions

DOI10.1080/10556788.2014.945448zbMath1325.90083OpenAlexW1990471877MaRDI QIDQ2943836

No author found.

Publication date: 4 September 2015

Published in: Optimization Methods and Software (Search for Journal in Brave)

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

zbMATH Keywords

multiple objective optimization\(\varepsilon\)-(proper, weak) efficiencydirection scalarization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (3)

A revised Pascoletti-Serafini scalarization method for multiobjective optimization problems ⋮ Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization ⋮ Optimality conditions via scalarization for approximate quasi efficiency in multiobjective optimization

Cites Work

• On approximating weakly/properly efficient solutions in multi-objective programming
• Optimality conditions for approximate solutions of vector optimization problems
• Generating \(\varepsilon\)-efficient solutions in multiobjective programming
• On approximate solutions in vector optimization problems via scalarization
• \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
• Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems
• \(\epsilon\)-solutions in vector minimization problems
• Epsilon efficiency
• \(\epsilon\)-duality theorem of nondifferentiable nonconvex multiobjective programming
• On several concepts for \(\varepsilon\)-efficiency
• \(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems
• Epsilon approximate solutions for multiobjective programming problems
• Scalarizing vector optimization problems
• \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
• Optimality conditions for metrically consistent approximate solutions in vector optimization
• Cone characterizations of approximate solutions in real vector optimization
• ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
• Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization
• A unified vector optimization problem: complete scalarizations and applications
• Necessary conditions for ε-optimality
• ε-approximate solutions in multiobjective optimization
• On Approximate Solutions in Convex Vector Optimization
• Between Pareto efficiency and Pareto ε-efficiency
• ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps
• Approximately Efficient Solutions in Vector Optimization
• A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems

This page was built for publication: Characterizing ϵ-properly efficient solutions