A regression study of the number of efficient extreme points in multiple objective linear programming
DOI10.1016/J.EJOR.2003.09.014zbMATH Open1176.90558OpenAlexW2161076395MaRDI QIDQ706929FDOQ706929
Authors: 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
Recommendations
- Random problem genertion and the computation of efficient extreme points in multiple objective linear programming
- An approach for finding efficient points in multiobjective linear programming
- Bounding MOLP objective functions: effect on efficient set size
- Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming
- Multiple objective linear programming (MOLP) problems with the same objective space
RegressionComputational experimentsEfficient extreme pointsLarge MOLPsMultiple objective linear programmingRandom problem generator
Cites Work
- Finding all efficient extreme points for multiple objective linear programs
- A revised simplex method for linear multiple objective programs
- Unified interactive multiple objective programming
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Title not available (Why is that?)
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- Quad-Trees and Linear Lists for Identifying Nondominated Criterion Vectors
- 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
- Towards finding global representations of the efficient set in multiple objective mathematical programming
- Optimization over the efficient set using an active constraint approach
- A simplified MOLP algorithm: The MOLP-S procedure
- Identifying Efficient Vectors: Some Theory and Computational Results
- Random problem genertion and the computation of efficient extreme points in multiple objective linear programming
- A parallel algorithm for multiple objective linear programs
- Bounding MOLP objective functions: effect on efficient set size
- Title not available (Why is that?)
- A Heuristic for Estimating Nadir Criterion Values in Multiple Objective Linear Programming
Cited In (7)
- 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
- Random problem genertion and the computation of efficient extreme points in multiple objective linear programming
- A methodology for assessing eco-efficiency in logistics networks
- A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program
- Bounding MOLP objective functions: effect on efficient set size
- A branch-and-bound algorithm for representative integer efficient solutions in multiple objective network programming problems
Uses Software
This page was built for publication: A regression study of the number of efficient extreme points in multiple objective linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q706929)
