Nonadjacent extreme point methods for solving linear programs

In this article we present some advanced basis or block-pivoting, relaxation, and feasible direction methods for solving linear programming problems. Preliminary computational results appear to indicate that the former two types of simplex-based procedures may hold promise for solving linear programming problems, unlike the third type of scheme which is shown to be computationally unattractive.

[1]  Paula M. J. Harris.  Pivot selection methods of the Devex LP code , 1973, Math. Program..

[2]  Ming S. Hung,et al.  Solving the Assignment Problem by Relaxation , 1980, Oper. Res..

[3]  M. C. Cheng.  New criteria for the simplex algorithm , 1980, Math. Program..

[4]  William H. Cunningham,et al.  A network simplex method , 1976, Math. Program..

[5]  Leon Cooper,et al.  Nonextreme point solution strategies for linear programs , 1979 .

[6]  Letter to the Editor---A Conjecture Concerning the Smallest Bound on the Iterations in Linear Programming , 1963 .

[7]  Leon S. Lasdon,et al.  Optimization Theory of Large Systems , 1970 .

[8]  Darwin Klingman,et al.  The alternating basis algorithm for assignment problems , 1977, Math. Program..

[9]  Andrew B. Whinston,et al.  The Solution of Leontief Substitution Systems using Matrix Iterative Techniques , 1975 .

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

[11]  J. C. Dickson,et al.  A decision rule for improved efficiency in solving linear programming problems with the simplex algorithm , 1960, CACM.

[12]  P. Wolfe.  The Composite Simplex Algorithm , 1965 .

[13]  S. Paranjape.  The Simplex Method: Two Basic Variables Replacement , 1965 .

[14]  V. Klee.  A class of linear programming problems requiring a large number of iterations , 1965 .

[15]  A. J. Goldman,et al.  Letter to the Editor---Examples Relating to the Simplex Method , 1964 .