Constructing efficient solutions structure of multiobjective linear programming
From MaRDI portal
Recommendations
- A modified method for constructing efficient solutions structure of MOLP
- Determining maximal efficient faces in multiobjective linear programming problem
- Solving multiobjective linear programming problems using ball center of polytopes
- An approach for finding efficient points in multiobjective linear programming
- Determination of the efficient set in multiobjective linear programming
Cites work
- A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs
- A method of transferring cones of intersection form to cones of sum form and its applications in data envelopment analysis models
- A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
- Algorithms for the vector maximization problem
- An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
- Analysis of the objective space in multiple objective linear programming
- Complete efficiency and the initialization of algorithms for multiple objective programming
- Constructing the set of efficient objective values in multiple objective linear programs
- Determination of the efficient set in multiobjective linear programming
- Finding all maximal efficient faces in multiobjective linear programming
- Generating all maximal efficient faces for multiple objective linear programs
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- Hybrid approach for solving multiple-objective linear programs in outcome space
- Linear multiobjective programming
- Multiple Criteria Decision Making, Multiattribute Utility Theory: The Next Ten Years
- Normal cones to a polyhedral convex set and generating efficient faces in linear multiobjective programming
- On the Minimization of Completion Time Variance with a Bicriteria Extension
- Outcome space partition of the weight set in multiobjective linear programming
- Proper efficiency and the theory of vector maximization
- 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
(19)- Determining maximal efficient faces in multiobjective linear programming problem
- Constructing the set of efficient objective values in linear multiple objective transportation problems
- On FGP approach to multiobjective quadratic fractional programming problem
- On generating the set of nondominated solutions of a linear programming problem with parameterized fuzzy numbers
- The maximal descriptor index set for a face of a convex polyhedral set and some applications
- Solving multiobjective linear programming problems using ball center of polytopes
- Finding efficient surfaces in DEA-R models
- A multiobjective based approach for mathematical programs with linear flexible constraints
- Adjacency based method for generating maximal efficient faces in multiobjective linear programming
- An approach for finding efficient points in multiobjective linear programming
- scientific article; zbMATH DE number 3974756 (Why is no real title available?)
- The construction of a solution of the alternative linear programming problem
- Efficient curve fitting: an application of multiobjective programming
- A new geometric approach to multiobjective linear programming problems
- A method to find all efficient solutions of an interval multiple objective linear programming problem
- A semidefinite programming approach for solving multiobjective linear programming
- Characteristics and structures of weak efficient surfaces of production possibility sets
- Constructing the set of efficient objective values in multiple objective linear programs
- A modified method for constructing efficient solutions structure of MOLP
This page was built for publication: Constructing efficient solutions structure of multiobjective linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557002)
