Minimal representations of a face of a convex polyhedron and some applications
DOI10.1007/s40306-021-00437-yzbMath1480.90223OpenAlexW3185754000MaRDI QIDQ2667218
Publication date: 24 November 2021
Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40306-021-00437-y
multiple objective programmingfaces of a polyhedrondegeneracy degrees of facesmaximal descriptor index setprime and minimal representations of a face
Applications of mathematical programming (90C90) Multi-objective and goal programming (90C29) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Linear ordinary differential equations and systems in the complex domain (34M03)
Cites Work
- Unnamed Item
- A new method for determining all maximal efficient faces in multiple objective linear programming
- Note on prime representations of convex polyhedral sets
- Minimal representation of convex polyhedral sets
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- Consistency, redundancy, and implied equalities in linear systems
- Degeneracy degrees of constraint collections
- Optimization over the efficient set of a parametric multiple objective linear programming problem
- The maximal descriptor index set for a face of a convex polyhedral set and some applications
- An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
- Efficient Elimination of Redundancies in Polyhedra by Raytracing
- A common formula to compute the efficient sets of a class of multiple objective linear programming problems
- Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints
- Optimizing Over the Efficient Set Using a Top-Down Search of Faces
- Calculus of convex polyhedra and polyhedral convex functions by utilizing a multiple objective linear programming solver
- A representation of generalized convex polyhedra and applications
- Combinatorial Redundancy Detection
- State Constraints in Convex Control Problems of Bolza
- Augmented Lagrangian method for large-scale linear programming problems
This page was built for publication: Minimal representations of a face of a convex polyhedron and some applications
