An exact method for computing the nadir values in multiple objective linear programming

DOI10.1016/j.ejor.2008.10.003zbMath1163.90724OpenAlexW1998411112WikidataQ57664312 ScholiaQ57664312MaRDI QIDQ1027447

João Paulo Costa, Maria João Alves

Publication date: 29 June 2009

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.10.003

zbMATH Keywords

multiple criteria analysismultiple objective programmingnadir point

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (11)

Optimizing over the properly efficient set of convex multi-objective optimization problems ⋮ Towards a multi-objective performance assessment and optimization model of a two-echelon supply chain using SCOR metrics ⋮ Biobjective robust optimization over the efficient set for Pareto set reduction ⋮ A new exact method for linear bilevel problems with multiple objective functions at the lower level ⋮ On nadir points of multiobjective integer programming problems ⋮ Characterizing coherence, correcting incoherence ⋮ Modified interactive Chebyshev algorithm (MICA) for convex multiobjective programming ⋮ An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems ⋮ New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach ⋮ Finding nadir points in multi-objective integer programs ⋮ Computing the nadir point for multiobjective discrete optimization problems

Uses Software

• TRIMAP

Cites Work

• Unnamed Item
• Unnamed Item
• A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem
• Optimization over the efficient set: overview
• Computational experience concerning payoff tables and minimum criterion values over the efficient set
• Global optimization in practice: An application to interactive multiple objective linear programming
• Computation of ideal and Nadir values and implications for their use in MCDM methods.
• On optimization over the efficient set in linear multicriteria programming
• Identifying Efficient Vectors: Some Theory and Computational Results
• A Heuristic for Estimating Nadir Criterion Values in Multiple Objective Linear Programming
• Optimization over the efficient set

This page was built for publication: An exact method for computing the nadir values in multiple objective linear programming