Generating -efficient solutions in multiobjective programming
From MaRDI portal
Publication:857285
DOI10.1016/J.EJOR.2005.10.023zbMATH Open1102.90057OpenAlexW1975258684MaRDI QIDQ857285FDOQ857285
Authors: 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
Recommendations
- Exact generation of epsilon-efficient solutions in multiple objective programming
- Generation of efficient and ε -efficient solutions in multiple objective linear programming
- On approximate efficiency in multiobjective programming
- Some characterization of \(\varepsilon\)-approximate solutions for multiobjective programming problems
- Epsilon efficiency
multiobjective programs\(\varepsilon\)-efficient solutions\(\varepsilon\)-non-dominated outcomes\(\varepsilon\)-optimality\(\varepsilon\)-Pareto outcomesscalarizations
Cites Work
- Title not available (Why is that?)
- \(\epsilon\)-solutions in vector minimization problems
- Robust discrete optimization and its applications
- Epsilon approximate solutions for multiobjective programming problems
- Scalarizing vector optimization problems
- \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
- Epsilon efficiency
- On Approximate Solutions in Convex Vector Optimization
- Title not available (Why is that?)
- Epsilon-dominating solutions in mean-variance portfolio analysis
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Title not available (Why is that?)
- Existence of efficient solutions for vector maximization problems
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
- \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows
- Stability results for approximately efficient solutions
- Title not available (Why is that?)
- A D.C. biobjective location model
- Relationships between efficient set and \(\epsilon\)-efficient set
- Epsilon dominance and constraint partitioning in multiple objective problems
- Recent Results and Open Problems in Evolutionary Multiobjective Optimization
- Approximately Efficient Solutions in Vector Optimization
Cited In (43)
- Title not available (Why is that?)
- Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems
- Generalized rationnal efficiency in multiobjective programming
- A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems
- On a weakly C-$\epsilon$-vector saddle point approach in weak vector problems
- Sustainable supplier selection model with a trade-off between supplier development and supplier switching
- A new scalarization method for finding the efficient frontier in non-convex multi-objective problems
- Multi-scenario multi-objective optimization with applications in engineering design
- On approximate starshapedness in multiobjective optimization
- Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems
- A combined scalarizing method for multiobjective programming problems
- On approximating weakly/properly efficient solutions in multi-objective programming
- Exact generation of epsilon-efficient solutions in multiple objective programming
- An algorithm for a multicriteria optimization problem and its application to a facility location problem
- An iterative approach to solve multiobjective linear fractional programming problems
- Necessary and sufficient Karush-Kuhn-Tucker conditions for multiobjective Markov chains optimality
- Characterizing ϵ-properly efficient solutions
- A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
- A combined scalarization method for multi-objective optimization problems
- The multicriteria big cube small cube method
- Optimality conditions via scalarization for approximate quasi efficiency in multiobjective optimization
- A flexible objective-constraint approach and a new algorithm for constructing the Pareto front of multiobjective optimization problems
- Cone characterizations of approximate solutions in real vector optimization
- Sustainability SI: multimode multicommodity network design model for intermodal freight transportation with transfer and emission costs
- Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
- A revised Pascoletti-Serafini scalarization method for multiobjective optimization problems
- Generating equidistant representations in biobjective programming
- Integrated business continuity and disaster recovery planning: towards organizational resilience
- On approximate efficiency for nonsmooth robust vector optimization problems
- A COMPUTATIONAL APPROACH BASED ON THE \epsilon-CONSTRAINT METHOD IN MULTI-OBJECTIVE OPTIMIZATION PROBLEMS
- A new scalarization technique and new algorithms to generate Pareto fronts
- Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization
- Algebra of efficient sets for multiobjective complex systems
- A modified Quasi-Newton method for vector optimization problem
- The modified objective-constraint scalarization approach for multiobjective optimization problems
- Tradeoff-based decomposition and decision-making in multiobjective programming
- Improving the min-max method for multiobjective programming
- A unified vector optimization problem: complete scalarizations and applications
- Solving set-valued optimization problems using a multiobjective approach
- \(\varPhi\)-strict local efficient solution for multiobjective programming problems
- On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives
- Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization
- A numerical method for constructing the Pareto front of multi-objective optimization problems
This page was built for publication: Generating \(\varepsilon\)-efficient solutions in multiobjective programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q857285)
