Random problem genertion and the computation of efficient extreme points in multiple objective linear programming
From MaRDI portal
Publication:1342884
DOI10.1007/BF01299208zbMATH Open0819.90088MaRDI QIDQ1342884FDOQ1342884
Publication date: 15 January 1995
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Recommendations
- Generating all efficient extreme solutions in multiple objective linear programming problem and its application to multiplicative programming
- Efficient solution generation for multiple objective linear programming based on extreme ray generation method
- scientific article; zbMATH DE number 2159095
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- A regression study of the number of efficient extreme points in multiple objective linear programming
multiple objective linear programmingADBASEcomputation of efficient extreme pointsrandom problem generationTchebycheff utility functions
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A revised simplex method for linear multiple objective programs
- Title not available (Why is that?)
- Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
- Algorithms for the vector maximization problem
- Computational experience concerning payoff tables and minimum criterion values over the efficient set
- Linear multiobjective programming
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- Multiple Objective Linear Programming with Interval Criterion Weights
- 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
- Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program
- A simplified MOLP algorithm: The MOLP-S procedure
- Title not available (Why is that?)
- Title not available (Why is that?)
- Potential solutions of linear systems: the multi-criteria multiple constraint levels program
- Title not available (Why is that?)
Cited In (17)
- Title not available (Why is that?)
- Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint
- A regression study of the number of efficient extreme points in multiple objective linear programming
- Efficient solution generation for multiple objective linear programming based on extreme ray generation method
- GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs
- A methodology for assessing eco-efficiency in logistics networks
- 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
- Efficiency analysis, generating an efficient extreme point for an MOLP, and some comparisons
- Title not available (Why is that?)
- A comment on multi-stage DEA methodology
- Bounding MOLP objective functions: effect on efficient set size
- Title not available (Why is that?)
- Probabilistic adaptations of point generation schemes in some global optimization algorithms
- A bookkeeping strategy for multiple objective linear programs
- Title not available (Why is that?)
- Generating all efficient extreme solutions in multiple objective linear programming problem and its application to multiplicative programming
Uses Software
This page was built for publication: Random problem genertion and the computation 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 Q1342884)
