An exact method for computing the nadir values in multiple objective linear programming
From MaRDI portal
Publication:1027447
DOI10.1016/J.EJOR.2008.10.003zbMATH Open1163.90724OpenAlexW1998411112WikidataQ57664312 ScholiaQ57664312MaRDI QIDQ1027447FDOQ1027447
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
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
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- Title not available (Why is that?)
- Optimization over the efficient set
- Optimization over the efficient set: overview
- Computational experience concerning payoff tables and minimum criterion values over the efficient set
- Title not available (Why is that?)
- On optimization over the efficient set in linear multicriteria programming
- Identifying Efficient Vectors: Some Theory and Computational Results
- 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
- Global optimization in practice: An application to interactive multiple objective linear programming
Cited In (13)
- New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- Towards a multi-objective performance assessment and optimization model of a two-echelon supply chain using SCOR metrics
- A new exact method for linear bilevel problems with multiple objective functions at the lower level
- Biobjective robust optimization over the efficient set for Pareto set reduction
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- Characterizing coherence, correcting incoherence
- On nadir points of multiobjective integer programming problems
- Title not available (Why is that?)
- Computing the nadir point for multiobjective discrete optimization problems
- Finding nadir points in multi-objective integer programs
- Optimizing over the properly efficient set of convex multi-objective optimization problems
- Modified interactive Chebyshev algorithm (MICA) for convex multiobjective programming
Uses Software
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)
