Minimal Representations of a Face of a Convex Polyhedron and Some Applications
Author:
Open Access
- 3 July 2021
- journal article
- research article
- Published by Springer Nature in Acta Mathematica Vietnamica
- Vol. 46 (4) , 761-778
Abstract
In this paper, we propose a method for determining all minimal representations of a face of a polyhedron defined by a system of linear inequalities. Main difficulties for determining prime and minimal representations of a face are that the deletion of one redundant constraint can change the redundancy of other constraints and the number of descriptor index pairs for the face can be huge. To reduce computational efforts in finding all minimal representations of a face, we prove and use properties that deleting strongly redundant constraints does not change the redundancy of other constraints and all minimal representations of a face can be found only in the set of all prime representations of the face corresponding to the maximal descriptor index set for it. The proposed method is based on a top-down search strategy, is easy to implement, and has many computational advantages. Based on minimal representations of a face, a reduction of degeneracy degrees of the face and ideas to improve some known methods for finding all maximal efficient faces in multiple objective linear programming are presented. Numerical examples are given to illustrate the method.Keywords
Funding Information
- Corvinus University of Budapest
This publication has 18 references indexed in Scilit:
- A representation of generalized convex polyhedra and applicationsOptimization, 2019
- A Primal Active-Set Minimal-Representation Algorithm for Polytopes with Application to Invariant-Set Calculations2018
- Calculus of convex polyhedra and polyhedral convex functions by utilizing a multiple objective linear programming solverOptimization, 2018
- Efficient Elimination of Redundancies in Polyhedra by Raytracing2017
- Augmented Lagrangian method for large-scale linear programming problemsOptimization Methods and Software, 2005
- Optimizing Over the Efficient Set Using a Top-Down Search of FacesOperations Research, 2000
- An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programmingOperations Research Letters, 1996
- Consistency, redundancy, and implied equalities in linear systemsAnnals of Mathematics and Artificial Intelligence, 1996
- A face search heuristic algorithm for optimizing over the efficient setNaval Research Logistics (NRL), 1993
- Note on prime representations of convex polyhedral setsJournal of Optimization Theory and Applications, 1989