A modified method for constructing efficient solutions structure of MOLP
From MaRDI portal
Recommendations
- Constructing efficient solutions structure of multiobjective linear programming
- A method for generating all efficient solutions of 0-1 multi-objective linear programming problem
- A simplified MOLP algorithm: The MOLP-S procedure
- On efficient solutions of 0-1 multi-objective linear programming problems
- Determining maximal efficient faces in multiobjective linear programming problem
Cites work
- A method of transferring cones of intersection form to cones of sum form and its applications in data envelopment analysis models
- Constructing efficient solutions structure of multiobjective linear programming
- Generating all maximal efficient faces for multiple objective linear programs
- Linear multiobjective programming
- Relations between half-space and finitely generated cones in polyhedral cone-ratio DEA models
- 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
Cited in
(9)- A simplified MOLP algorithm: The MOLP-S procedure
- Use of reference points of MOLP problems analysis
- Finding non dominated points for multiobjective integer convex programs with linear constraints
- On generating the set of nondominated solutions of a linear programming problem with parameterized fuzzy numbers
- Finding efficient surfaces in DEA-R models
- Adjacency based method for generating maximal efficient faces in multiobjective linear programming
- Alienor method to solve multi-objective linear programming (MOLP)
- Constructing efficient solutions structure of multiobjective linear programming
- A multi-objective production smoothing model with compressible operating times
This page was built for publication: A modified method for constructing efficient solutions structure of MOLP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q967909)