Enumerating extreme points of a highly degenerate polytope
Authors:
- 30 April 1994
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 21 (4) , 397-410
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A new pivoting rule for solving various degeneracy problemsOperations Research Letters, 1992
- Solving multiple objective linear programs in objective spaceEuropean Journal of Operational Research, 1990
- Identifying nondominated alternatives with partial information for multiple-objective discrete and linear programming problemsIEEE Transactions on Systems, Man, and Cybernetics, 1989
- On the structure of the set bases of a degenerate pointJournal of Optimization Theory and Applications, 1985
- Finding all efficient extreme points for multiple objective linear programsMathematical Programming, 1978
- An algorithm for determining all extreme points of a convex polytopeMathematical Programming, 1977
- 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
- Finding all vertices of a convex polyhedronNumerische Mathematik, 1968