Random problem genertion and the computation of efficient extreme points in multiple objective linear programming
From MaRDI portal
Publication:1342884
DOI10.1007/BF01299208zbMath0819.90088MaRDI QIDQ1342884
Publication date: 15 January 1995
Published in: Computational Optimization and Applications (Search for Journal in Brave)
multiple objective linear programmingADBASEcomputation of efficient extreme pointsrandom problem generationTchebycheff utility functions
Related Items (8)
A bookkeeping strategy for multiple objective linear programs ⋮ Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint ⋮ A methodology for assessing eco-efficiency in logistics networks ⋮ A comment on multi-stage DEA methodology ⋮ A regression study of the number of efficient extreme points in multiple objective linear programming ⋮ Optimization of a linear function over the set of stochastic efficient solutions ⋮ Goal programming for decision making: An overview of the current state-of-the-art ⋮ GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Potential solutions of linear systems: the multi-criteria multiple constraint levels program
- Computational experience concerning payoff tables and minimum criterion values over the efficient set
- A simplified MOLP algorithm: The MOLP-S procedure
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- Linear multiobjective programming
- A general method for determining the set of all efficient solutions to a linear vectormaximum problem
- Generating all maximal efficient faces for multiple objective linear programs
- Determination of the efficient set in multiobjective linear programming
- Multiple Objective Linear Programming with Interval Criterion Weights
- Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- A revised simplex method for linear multiple objective programs
- Algorithms for the vector maximization problem
- Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
This page was built for publication: Random problem genertion and the computation of efficient extreme points in multiple objective linear programming
