Adjacency based method for generating maximal efficient faces in multiobjective linear programming
From MaRDI portal
(Redirected from Publication:345543)
Recommendations
- Adjacency-based local top-down search method for finding maximal efficient faces in multiple objective linear programming
- Generating efficient faces for multiobjective linear programming problems
- A new method for determining all maximal efficient faces in multiple objective linear programming
- Determining maximal efficient faces in multiobjective linear programming problem
- A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs
Cites work
- A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs
- A fuzzy approach to the multiobjective transportation problem
- A general method for determining the set of all efficient solutions to a linear vectormaximum problem
- A modified method for constructing efficient solutions structure of MOLP
- A new pivoting rule for solving various degeneracy problems
- An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Constructing efficient solutions structure of multiobjective linear programming
- Determination of the efficient set in multiobjective linear programming
- Determining maximal efficient faces in multiobjective linear programming problem
- Finding all maximal efficient faces in multiobjective linear programming
- Further analysis of an outcome set-based algorithm for multiple-objective linear programming
- Generating the efficient outcome set in multiple objective linear programs: The bicriteria case
- scientific article; zbMATH DE number 3833720 (Why is no real title available?)
- scientific article; zbMATH DE number 4091200 (Why is no real title available?)
- Outcome space partition of the weight set in multiobjective linear programming
- Pivoting in an outcome polyhedron
- Primal-dual simplex method for multiobjective linear 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
- Towards finding global representations of the efficient set in multiple objective mathematical programming
- Two storage inventory problem with dynamic demand and interval valued lead-time over finite time horizon under inflation and time-value of money
- Vector maximization at a degenerate vertex
Cited in
(8)- A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs
- Maximal descriptor set characterizations of efficient faces in multiple objective linear programming.
- Finding non dominated points for multiobjective integer convex programs with linear constraints
- Generating efficient faces for multiobjective linear programming problems
- scientific article; zbMATH DE number 943301 (Why is no real title available?)
- Adjacency-based local top-down search method for finding maximal efficient faces in multiple objective linear programming
- Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint
- A method to find all efficient solutions of an interval multiple objective linear programming problem
This page was built for publication: Adjacency based method for generating maximal efficient faces in multiobjective linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q345543)
