Generating \(\varepsilon\)-efficient solutions in multiobjective programming
From MaRDI portal
Publication:857285
DOI10.1016/j.ejor.2005.10.023zbMath1102.90057OpenAlexW1975258684MaRDI QIDQ857285
Alexander Engau, Margaret M. Wiecek
Publication date: 14 December 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.10.023
multiobjective programs\(\varepsilon\)-efficient solutions\(\varepsilon\)-non-dominated outcomes\(\varepsilon\)-optimality\(\varepsilon\)-Pareto outcomesscalarizations
Related Items (39)
Sustainability SI: multimode multicommodity network design model for intermodal freight transportation with transfer and emission costs ⋮ Solving set-valued optimization problems using a multiobjective approach ⋮ A combined scalarizing method for multiobjective programming problems ⋮ A modified Quasi-Newton method for vector optimization problem ⋮ Necessary and sufficient Karush-Kuhn-Tucker conditions for multiobjective Markov chains optimality ⋮ On approximate efficiency for nonsmooth robust vector optimization problems ⋮ Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits ⋮ Improving the min-max method for multiobjective programming ⋮ A revised Pascoletti-Serafini scalarization method for multiobjective optimization problems ⋮ A combined scalarization method for multi-objective optimization problems ⋮ Characterizing ϵ-properly efficient solutions ⋮ The multicriteria big cube small cube method ⋮ A numerical method for constructing the Pareto front of multi-objective optimization problems ⋮ On approximating weakly/properly efficient solutions in multi-objective programming ⋮ Sustainable supplier selection model with a trade-off between supplier development and supplier switching ⋮ A flexible objective-constraint approach and a new algorithm for constructing the Pareto front of multiobjective optimization problems ⋮ Generating equidistant representations in biobjective programming ⋮ Algebra of efficient sets for multiobjective complex systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets ⋮ Cone characterizations of approximate solutions in real vector optimization ⋮ An iterative approach to solve multiobjective linear fractional programming problems ⋮ Integrated business continuity and disaster recovery planning: towards organizational resilience ⋮ A new scalarization method for finding the efficient frontier in non-convex multi-objective problems ⋮ On approximate starshapedness in multiobjective optimization ⋮ On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives ⋮ Multi-scenario Multi-objective Optimization with Applications in Engineering Design ⋮ Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization ⋮ A unified vector optimization problem: complete scalarizations and applications ⋮ A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems ⋮ Tradeoff-based decomposition and decision-making in multiobjective programming ⋮ On a weakly C-$\epsilon$-vector saddle point approach in weak vector problems ⋮ Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector 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 ⋮ A New Scalarization Technique and New Algorithms to Generate Pareto Fronts ⋮ The modified objective-constraint scalarization approach for multiobjective optimization problems ⋮ Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows
- \(\epsilon\)-solutions in vector minimization problems
- Epsilon efficiency
- Existence of efficient solutions for vector maximization problems
- Epsilon dominance and constraint partitioning in multiple objective problems
- Epsilon-dominating solutions in mean-variance portfolio analysis
- Stability results for approximately efficient solutions
- Robust discrete optimization and its applications
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
- Epsilon approximate solutions for multiobjective programming problems
- Scalarizing vector optimization problems
- A D.C. biobjective location model
- \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
- On Approximate Solutions in Convex Vector Optimization
- Recent Results and Open Problems in Evolutionary Multiobjective Optimization
- Approximately Efficient Solutions in Vector Optimization
This page was built for publication: Generating \(\varepsilon\)-efficient solutions in multiobjective programming
