A regression study of the number of efficient extreme points in multiple objective linear programming
From MaRDI portal
Publication:706929
DOI10.1016/j.ejor.2003.09.014zbMath1176.90558OpenAlexW2161076395MaRDI QIDQ706929
Ralph E. Steuer, Craig A. Piercy
Publication date: 9 February 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2003.09.014
RegressionComputational experimentsEfficient extreme pointsLarge MOLPsMultiple objective linear programmingRandom problem generator
Related Items (4)
A branch‐and‐bound algorithm for representative integer efficient solutions in multiple objective network programming problems ⋮ Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming ⋮ Robust and sustainable supply chains under market uncertainties and different risk attitudes -- a case study of the German biodiesel market ⋮ A methodology for assessing eco-efficiency in logistics networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A simplified MOLP algorithm: The MOLP-S procedure
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- A general method for determining the set of all efficient solutions to a linear vectormaximum problem
- Determination of the efficient set in multiobjective linear programming
- Unified interactive multiple objective programming
- Random problem genertion and the computation of efficient extreme points in multiple objective linear programming
- A parallel algorithm for multiple objective linear programs
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Bounding MOLP objective functions: effect on efficient set size
- Optimization over the efficient set using an active constraint approach
- Identifying Efficient Vectors: Some Theory and Computational Results
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- Finding all efficient extreme points for multiple objective linear programs
- Towards finding global representations of the efficient set in multiple objective mathematical programming
- Quad-Trees and Linear Lists for Identifying Nondominated Criterion Vectors
- A Heuristic for Estimating Nadir Criterion Values in Multiple Objective Linear Programming
- A revised simplex method for linear multiple objective programs
This page was built for publication: A regression study of the number of efficient extreme points in multiple objective linear programming
