Linear Programming in Linear Time When the Dimension Is Fixed

It is demonstrated that the linear programming problem in d variables and n constraints can be solved in O(n) time when d is fixed. This bound follows from a multidimensional search technique which is applicable for quadratic programming as well. There is also developed an algorithm that is polynomial in both n and d provided d is bounded by a certain slowly growing function of n.

[1]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[2]  V. Klee,et al.  HOW GOOD IS THE SIMPLEX ALGORITHM , 1970 .

[3]  Donald E. Knuth,et al.  Mathematical Analysis of Algorithms , 1971, IFIP Congress.

[4]  William S. Meisel,et al.  Computer-oriented approaches to pattern recognition , 1972 .

[5]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[6]  Y. Chien,et al.  Pattern classification and scene analysis , 1974 .

[7]  Ronald L. Rivest,et al.  Expected time bounds for selection , 1975, Commun. ACM.

[8]  Arnold Schönhage,et al.  Finding the Median , 1976, J. Comput. Syst. Sci..

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

[10]  Louis Monier,et al.  Combinatorial Solutions of Multidimensional Divide-and-Conquer Recurrences , 1980, J. Algorithms.

[11]  Jon Louis Bentley,et al.  Multidimensional divide-and-conquer , 1980, CACM.

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

[13]  Nesa L'abbe Wu,et al.  Linear programming and extensions , 1981 .

[14]  Nimrod Megiddo,et al.  Is Binary Encoding Appropriate for the Problem-Language Relationship? , 1982, Theor. Comput. Sci..

[15]  Nimrod Megiddo,et al.  Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[16]  Nimrod Megiddo,et al.  Towards a Genuinely Polynomial Algorithm for Linear Programming , 1983, SIAM J. Comput..