An algorithm for determining all extreme points of a convex polytope
- 1 December 1977
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 12 (1) , 81-96
- https://doi.org/10.1007/bf01593771
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- An algorithm for determining redundant inequalities and all solutions to convex polyhedraNumerische Mathematik, 1975
- Generating All the Faces of a PolyhedronSIAM Journal on Applied Mathematics, 1974
- An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear InequalitiesOperations Research, 1973
- Extreme Point Mathematical ProgrammingManagement Science, 1972
- Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme PointsOperations Research, 1970
- Finding all vertices of a convex polyhedronNumerische Mathematik, 1968
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing CostOperations Research, 1968
- Solving the Fixed Charge Problem by Ranking the Extreme PointsOperations Research, 1968
- Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalitiesUSSR Computational Mathematics and Mathematical Physics, 1965
- An Algorithm for Finding All Vertices of Convex Polyhedral SetsJournal of the Society for Industrial and Applied Mathematics, 1961