The maximal descriptor index set for a face of a convex polyhedral set and some applications
From MaRDI portal
Publication:2345491
DOI10.1016/j.jmaa.2015.04.011zbMath1323.90064OpenAlexW2313869345MaRDI QIDQ2345491
Publication date: 22 May 2015
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2015.04.011
multiple objective programmingmaximal descriptor index set for a facemaximal efficient facesfaces of a polyhedron
Related Items (2)
Minimal representations of a face of a convex polyhedron and some applications ⋮ A new method for determining all maximal efficient faces in multiple objective linear programming
Cites Work
- Constructing efficient solutions structure of multiobjective linear programming
- Determining maximal efficient faces in multiobjective linear programming problem
- Analysis of the objective space in multiple objective linear programming
- Minimal representation of convex polyhedral sets
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- 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
- A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs
- Degeneracy in interior point methods for linear programming: A survey
- Finding all maximal efficient faces in multiobjective linear programming
- Determination of the efficient set in multiobjective linear programming
- Maximal descriptor set characterizations of efficient faces in multiple objective linear programming.
- Degeneracy degrees of constraint collections
- Optimization over the efficient set of a parametric multiple objective linear programming problem
- Normal cones to a polyhedral convex set and generating efficient faces in linear multiobjective programming
- Efficient solution generation for multiple objective linear programming based on extreme ray generation method
- Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.
- An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
- Faces of a polyhedron
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- Finding all efficient extreme points for multiple objective linear programs
- A revised simplex method for linear multiple objective programs
- Algorithms for the vector maximization problem
- Duality in nonlinear programming
This page was built for publication: The maximal descriptor index set for a face of a convex polyhedral set and some applications
