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

DOI10.1016/J.EJOR.2008.10.003MaRDI QIDQ1027447zbMATH OpenOpenAlexWikidataFDO

Authors Maria João Alves, João Paulo Costa

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)

Recommendations

• A Heuristic for Estimating Nadir Criterion Values in Multiple Objective Linear Programming
• scientific article; zbMATH DE number 1784660
• Computation of ideal and Nadir values and implications for their use in MCDM methods.
• Finding nadir points in multi-objective integer programs
• Computing the nadir point for multiobjective discrete optimization problems

Cites work

• A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem
• A Heuristic for Estimating Nadir Criterion Values in Multiple Objective Linear Programming
• Computation of ideal and Nadir values and implications for their use in MCDM methods.
• 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
• scientific article; zbMATH DE number 4012303 (Why is no real title available?)
• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• Identifying Efficient Vectors: Some Theory and Computational Results
• On optimization over the efficient set in linear multicriteria programming
• Optimization over the efficient set
• Optimization over the efficient set: overview

Cited in

(14)

• Computation of ideal and Nadir values and implications for their use in MCDM methods.
• On nadir points of multiobjective integer programming problems
• An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
• New -constraint methods for multi-objective integer linear programming: a Pareto front representation approach
• Modified interactive Chebyshev algorithm (MICA) for convex multiobjective programming
• Finding nadir points in multi-objective integer programs
• Computing the nadir point for multiobjective discrete optimization problems
• A new exact method for linear bilevel problems with multiple objective functions at the lower level
• 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 Heuristic for Estimating Nadir Criterion Values in Multiple Objective Linear Programming
• scientific article; zbMATH DE number 1784660 (Why is no real title available?)
• Characterizing coherence, correcting incoherence
• Optimizing over the properly efficient set of convex multi-objective optimization problems

Describes a project that uses

Uses Software

• TRIMAP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1027447)