On approximating weakly/properly efficient solutions in multi-objective programming
From MaRDI portal
Publication:410073
DOI10.1016/j.mcm.2011.08.013zbMath1235.90136OpenAlexW2071925993MaRDI QIDQ410073
B. A. Ghaznavi-Ghosoni, Esmaile Khorram
Publication date: 15 April 2012
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2011.08.013
multi-objective optimizationapproximate solutionscalarization method\(\varepsilon \)-proper efficiency
Related Items (8)
A combined scalarizing method for multiobjective programming problems ⋮ A revised Pascoletti-Serafini scalarization method for multiobjective optimization problems ⋮ Characterizing ϵ-properly efficient solutions ⋮ The study of certain optimization problems via variational inequalities ⋮ Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization ⋮ A Newton method for capturing Pareto optimal solutions of fuzzy 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized \((F,\alpha ,\rho ,\theta)\)-d-V-univex functions
- Optimality conditions for approximate solutions of vector optimization problems
- Optimality conditions for approximate solutions in multiobjective optimization problems
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming
- On approximate solutions in vector optimization problems via scalarization
- Some properties of approximate solutions for vector optimization problem with set-valued functions
- Improved \(\varepsilon\)-constraint method for multiobjective programming
- Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems
- \(\epsilon\)-solutions in vector minimization problems
- Epsilon efficiency
- An improved definition of proper efficiency for vector maximization with respect to cones
- Proper efficiency with respect to cones
- On the notion of proper efficiency in vector optimization
- \(\varepsilon\)-optimality and duality for multiobjective fractional programming
- \(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems
- Epsilon approximate solutions for multiobjective programming problems
- Using trade-off information in decision-making algorithms
- On sufficiency and duality in multiobjective programming problem under generalized \(\alpha \)-type I univexity
- Optimality conditions for metrically consistent approximate solutions in vector optimization
- Proper efficiency and the theory of vector maximization
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
- Proper Efficient Points for Maximizations with Respect to Cones
- ε-approximate solutions in multiobjective optimization
- On Approximate Solutions in Convex Vector Optimization
- Constructing robust crew schedules with bicriteria optimization
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Multicriteria Optimization
- A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
This page was built for publication: On approximating weakly/properly efficient solutions in multi-objective programming
