Randomly generated polytopes for testing mathematical programming algorithms

Randomly generated polytopes are used frequently to test and compare algorithms for a variety of mathematical programming problems. These polytopes are constructed by generating linear inequality constraints with coefficients drawn independently from a distribution such as the uniform or the normal.It is noted that this class of ‘random’ polytopes has a special property: the angles between the hyperplanes, though dependent on the specific distribution used, tend to be equal when the dimension of the space increases.Obviously this structure of ‘random’ polytopes may bias test results.

[1]  Stanley Zionts,et al.  Redundancy in Mathematical Programming , 1983 .

[2]  Brian K. Schmidt,et al.  The Probability that a Random Polytope is Bounded , 1977, Math. Oper. Res..

[3]  T. W. Anderson,et al.  An Introduction to Multivariate Statistical Analysis , 1959 .

[4]  James P. Ignizio,et al.  On the Establishment of Standards for Comparing Algorithm Performance , 1971 .

[5]  T. Cover,et al.  Geometrical Probability and Random Points on a Hypersphere , 1967 .

[6]  Richard E. Quandt,et al.  Letter to the Editor---On Upper Bounds for the Number of Iterations in Solving Linear Programs , 1964 .

[7]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[8]  T. W. Anderson.  An Introduction to Multivariate Statistical Analysis , 1959 .

[9]  V. Chvátal,et al.  Notes on Bland’s pivoting rule , 1978 .

[10]  Wim van Dam,et al.  SOME COMPUTATIONAL EXPERIMENTS WITH A PRIMAL-DUAL SURROGATE SIMPLEX ALGORITHM , 1978 .

[11]  J. Telgen.  Redundancy and linear programs , 1981 .

[12]  Robert L. Smith,et al.  Random polytopes: Their definition, generation and aggregate properties , 1982, Math. Program..

[13]  S. Zionts.  Some Empirical Tests of the Criss-Cross Method , 1972 .

[14]  H. Piaggio.  Mathematical Analysis , 1955, Nature.

[15]  L. G. H. Cijan.  A polynomial algorithm in linear programming , 1979 .

[16]  I. J. Schoenberg,et al.  The Relaxation Method for Linear Inequalities , 1954, Canadian Journal of Mathematics.

[17]  T. Liebling,et al.  On the number of iterations of the simplex method. , 1972 .