A class of linear programming problems requiring a large number of iterations
- 1 August 1965
- journal article
- Published by Springer Nature in Numerische Mathematik
- Vol. 7 (4) , 313-321
- https://doi.org/10.1007/bf01436525
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Paths on polyhedra. IIPacific Journal of Mathematics, 1966
- Paths on Polyhedra. IJournal of the Society for Industrial and Applied Mathematics, 1965
- Heights of convex polytopesJournal of Mathematical Analysis and Applications, 1965
- Letter to the Editor—On Upper Bounds for the Number of Iterations in Solving Linear ProgramsOperations Research, 1964
- Letter to the Editor—Examples Relating to the Simplex MethodOperations Research, 1964
- On the Number of Vertices of a Convex PolytopeCanadian Journal of Mathematics, 1964
- Diameters of Polyhedral GraphsCanadian Journal of Mathematics, 1964
- Linear Programming and ExtensionsPublished by Walter de Gruyter GmbH ,1963
- An experimental study of the simplex methodProceedings of Symposia in Applied Mathematics, 1963
- Remarks on a previous paper.The Michigan Mathematical Journal, 1953