Improved \(\varepsilon\)-constraint method for multiobjective programming
From MaRDI portal
Publication:1014011
DOI10.1007/s10957-008-9394-2zbMath1191.90054OpenAlexW2091290449MaRDI QIDQ1014011
Matthias Ehrgott, Stefan Ruzika
Publication date: 24 April 2009
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-008-9394-2
Related Items (42)
A multiple objective methodology for sugarcane harvest management with varying maturation periods ⋮ Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data ⋮ Parametric approach to quadratically constrained multi-level multi-objective quadratic fractional programming ⋮ A combined scalarizing method for multiobjective programming problems ⋮ Linear fractional multi-objective optimization problems subject to fuzzy relational equations with a continuous Archimedean triangular norm ⋮ An approximation algorithm for multi-objective optimization problems using a box-coverage ⋮ Relaxation of constraints in lexicographic multiobjective programming problems ⋮ A multi-criteria approach for hospital capacity analysis ⋮ An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems ⋮ An exact algorithm for biobjective mixed integer linear programming problems ⋮ Improving the min-max method for multiobjective programming ⋮ A revised Pascoletti-Serafini scalarization method for multiobjective optimization problems ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ A combined scalarization method for multi-objective optimization problems ⋮ Slack-based generalized Tchebycheff norm scalarization approaches for solving multiobjective optimization problems ⋮ A modeling framework for incorporating DEA efficiency into set covering, packing, and partitioning formulations ⋮ On approximating weakly/properly efficient solutions in multi-objective programming ⋮ Non-contour efficient fronts for identifying most preferred portfolios in sustainability investing ⋮ A supply chain design problem with facility location and bi-objective transportation choices ⋮ A flexible objective-constraint approach and a new algorithm for constructing the Pareto front of multiobjective optimization problems ⋮ A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets ⋮ Computationally efficient approach for solving lexicographic multicriteria optimization problems ⋮ A smoothing method for solving bilevel multiobjective programming problems ⋮ Solving fractional multicriteria optimization problems with sum of squares convex polynomial data ⋮ Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems ⋮ A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs ⋮ Whole blood or apheresis donations? A multi-objective stochastic optimization approach ⋮ Interactive decision support in radiation therapy treatment planning ⋮ An approximation algorithm for convex multi-objective programming problems ⋮ An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems ⋮ Efficient multiobjective optimization employing Gaussian processes, spectral sampling and a genetic algorithm ⋮ Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations ⋮ An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets ⋮ Multi-objective evolutionary algorithms for a reliability location problem ⋮ Unnamed Item ⋮ Outer Branching: How to Optimize under Partial Orders? ⋮ Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization ⋮ A modified direction approach for proper efficiency of multiobjective optimization ⋮ New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach ⋮ 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
- Nearly subconvexlike set-valued maps and vector optimization problems
- Theory of multiobjective optimization
- An improved definition of proper efficiency for vector maximization with respect to cones
- On characterizations of proper efficiency for nonconvex multiobjective optimization
- Multiple criteria decision analysis. State of the art surveys
- Proper efficiency and the theory of vector maximization
- Characterizations of Hartley proper efficiency in nonconvex vector optimization
- A Bibliography on the Applications of Mathematical Programming Multiple-objective Methods
- The Vector Maximization Problem: Proper Efficiency and Stability
- Proper Efficient Points for Maximizations with Respect to Cones
- On Cone-Efficiency, Cone-Convexity and Cone-Compactness
- Constructing robust crew schedules with bicriteria optimization
- Multicriteria Optimization
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
This page was built for publication: Improved \(\varepsilon\)-constraint method for multiobjective programming
