Randomly generated polytopes for testing mathematical programming algorithms
- 1 June 1983
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 26 (2) , 172-181
- https://doi.org/10.1007/bf02592053
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Notes on Bland’s pivoting rulePublished by Springer Nature ,1978
- The Probability that a Random Polytope is BoundedMathematics of Operations Research, 1977
- Some Empirical Tests of the Criss-Cross MethodManagement Science, 1972
- On the Establishment of Standards for Comparing Algorithm PerformanceInterfaces, 1971
- Geometrical Probability and Random Points on a HypersphereThe Annals of Mathematical Statistics, 1967
- Letter to the Editor—On Upper Bounds for the Number of Iterations in Solving Linear ProgramsOperations Research, 1964
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954