Computation of ideal and Nadir values and implications for their use in MCDM methods.

DOI10.1016/S0377-2217(02)00595-7zbMath1043.90039OpenAlexW2056289270MaRDI QIDQ1406960

Dagmar Tenfelde-Podehl, Matthias Ehrgott

Publication date: 7 September 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00595-7

zbMATH Keywords

Multicriteria optimizationCompromise programmingNadir points

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Management decision making, including multiple objectives (90B50)

Related Items

Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach, Towards a multi-objective performance assessment and optimization model of a two-echelon supply chain using SCOR metrics, \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems, Biobjective robust optimization over the efficient set for Pareto set reduction, Bilevel programming for generating discrete representations in multiobjective optimization, Bound sets for biobjective combinatorial optimization problems, Application of a hybrid intelligent decision support model in logistics outsourcing, On nadir points of multiobjective integer programming problems, Advanced network connectivity features and zonal requirements in covering location problems, Effective anytime algorithm for multiobjective combinatorial optimization problems, A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives, A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times, On the number of non-dominated points of a multicriteria optimization problem, Characterizing coherence, correcting incoherence, Heuristic for a new multiobjective scheduling problem, A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions, Multi-objective branch and bound, A new method for optimizing a linear function over the efficient set of a multiobjective integer program, Variable preference modeling with ideal-symmetric convex cones, Interactive decision support in radiation therapy treatment planning, A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems, Modified interactive Chebyshev algorithm (MICA) for non-convex multiobjective programming, Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors., Best compromise solution for a new multiobjective scheduling problem, NAUTILUS method: an interactive technique in multiobjective optimization based on the Nadir point, Modified interactive Chebyshev algorithm (MICA) for convex multiobjective programming, A heuristic two-phase solution approach for the multi-objective dial-a-ride problem, The Need for and Possible Methods of Objective Ranking, Multi-objective optimisation of positively homogeneous functions and an application in radiation therapy, Incorporating preferential weights as a benchmark into a sequential reference point method, An exact method for computing the nadir values in multiple objective linear programming, Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem, A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems, Finding nadir points in multi-objective integer programs, Computing the nadir point for multiobjective discrete optimization problems, A preference-based evolutionary algorithm for multiobjective optimization: the weighting achievement scalarizing function genetic algorithm, On the use of the \(L_{p}\) distance in reference point-based approaches for multiobjective optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient spanning trees
• Theory of multiobjective optimization
• Careful usage of pessimistic values is needed in multiple objectives optimization
• Pairwise-comparison methods in multiple objective programming, with applications in a long-term energy-planning model
• On the completeness and constructiveness of parametric characterizations to vector optimization problems
• Computational experience concerning payoff tables and minimum criterion values over the efficient set
• Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
• A bicriterion shortest path algorithm
• An all-linear programming relaxation algorithm for optimizing over the efficient set
• A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case
• Bicriteria network flow problems: Integer case
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• Approximating the noninferior set in multiobjective linear programming problems
• A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
• Optimizing a linear function over an efficient set
• Utility function programs and optimization over the efficient set in multiple-objective decision making
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
• Multicriteria optimization
• The problem of the optimal biobjective spanning tree
• A survey and annotated bibliography of multiobjective combinatorial optimization
• Maximizing a concave function over the efficient or weakly-efficient set
• Uncertainty and method choice in discrete multiobjective programming problems
• Dual approach to minimization on the set of Pareto-optimal solutions
• Proper Efficiency in Nonconvex Multicriteria Programming
• Optimization over the efficient set using an active constraint approach
• Multicriteria network location problems with sum objectives
• A naïve approach for solving MCDM problems: the GUESS method
• A Heuristic for Estimating Nadir Criterion Values in Multiple Objective Linear Programming
• Interactive bundle-based method for nondifferentiable multiobjeective optimization: nimbus^§
• Linear programming with multiple objective functions: Step method (stem)
• Optimization over the efficient set
• Optimization over the efficient set
• Conical algorithm in global optimization for optimizing over efficient sets