Improved \(\varepsilon\)-constraint method for multiobjective programming
From MaRDI portal
Publication:1014011
DOI10.1007/s10957-008-9394-2zbMath1191.90054MaRDI 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
90C29: Multi-objective and goal programming
Related Items
On approximating weakly/properly efficient solutions in multi-objective programming, An approximation algorithm for convex multi-objective programming problems, A supply chain design problem with facility location and bi-objective transportation choices, Interactive decision support in radiation therapy treatment planning, Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization, Outer Branching: How to Optimize under Partial Orders?
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
