Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
From MaRDI portal
Publication:1029383
DOI10.1016/j.amc.2009.03.037zbMath1168.65029MaRDI QIDQ1029383
Publication date: 10 July 2009
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2009.03.037
algorithm; multi-objective programming; Pareto optimal solutions; \(\varepsilon \)-constraint method; a posteriori methods; effective implementation; GAMS
65K05: Numerical mathematical programming methods
Related Items
Portfolio selection with a minimax measure in safety constraint, A fuzzy multidimensional multiple-choice knapsack model for project portfolio selection using an evolutionary algorithm, Implementation aspects of interactive multiobjective optimization for modeling environments: the case of GAMS-NIMBUS, IPSSIS: an integrated multicriteria decision support system for equity portfolio construction and selection, Robust possibilistic programming for socially responsible supply chain network design: a new approach, Environmental supply chain network design using multi-objective fuzzy mathematical programming, Equity portfolio construction and selection using multiobjective mathematical programming, An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- Computational experience concerning payoff tables and minimum criterion values over the efficient set
- Multiobjective programming and planning
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- Multiple criteria decision analysis. State of the art surveys
- Finding representative systems for discrete bicriterion optimization problems
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- Constructing robust crew schedules with bicriteria optimization