Bounds on the number of vertices of perturbed polyhedra
- 1 September 1993
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 46-47 (2) , 249-269
- https://doi.org/10.1007/bf02023098
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Degeneracy problems in mathematical programming and degeneracy graphsORiON, 2003
- Determination of the efficient set in multiobjective linear programmingJournal of Optimization Theory and Applications, 1991
- Survey of solved and open problems in the degeneracy phenomenonMathematical Programming, 1988
- An Upper Bound Theorem for Polytope PairsMathematics of Operations Research, 1986
- On the structure of the set bases of a degenerate pointJournal of Optimization Theory and Applications, 1985
- The Complexity of Vertex Enumeration MethodsMathematics of Operations Research, 1983
- An Introduction to Convex PolytopesPublished by Springer Nature ,1983
- An Algorithm for Finding All Vertices of Convex Polyhedral SetsJournal of the Society for Industrial and Applied Mathematics, 1961
- The generalized simplex method for minimizing a linear form under linear inequality restraintsPacific Journal of Mathematics, 1955
- Optimality and Degeneracy in Linear ProgrammingEconometrica, 1952