A Dual Projective Pivot Algorithm for Linear Programming

Recently, a linear programming problem solver, called dual projective simplex method, was proposed (Pan, Computers and Mathematics with Applications, vol. 35, no. 6, pp. 119–135, 1998). This algorithm requires a crash procedure to provide an initial (normal or deficient) basis. In this paper, it is recast in a more compact form so that it can get itself started from scratch with any dual (basic or nonbasic) feasible solution. A new dual Phase-1 approach for producing such a solution is proposed. Reported are also computational results obtained with a set of standard NETLIB problems.

[1]  Pingqi Pan.  A Basis-Deficiency-Allowing Variation of the Simplex Method for Linear Programming , 1998 .

[2]  Robert G. Bland,et al.  New Finite Pivoting Rules for the Simplex Method , 1977, Math. Oper. Res..

[3]  Ping-Qi Pan,et al.  A phase-1 approach for the generalized simplex algorithm , 2001 .

[4]  William W. Hager,et al.  The Dual Active Set Algorithm and Its Application to Linear Programming , 2002, Comput. Optim. Appl..

[5]  Michel Bénichou,et al.  The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results , 1977, Math. Program..

[6]  A. J. Hoffman.  Cycling in the Simplex Algorithm , 2003 .

[7]  Pingqi Pan,et al.  Practical finite pivoting rules for the simplex method , 1990 .

[8]  Åke Björck,et al.  Numerical methods for least square problems , 1996 .

[9]  E. M. L. Beale,et al.  An alternative method for linear programming , 1954, Mathematical Proceedings of the Cambridge Philosophical Society.

[10]  Gene H. Golub,et al.  Matrix computations , 1983 .

[11]  P. Gill,et al.  Fortran package for constrained linear least-squares and convex quadratic programming. User's Guide for LSSOL (Version 1. 0) , 1986 .

[12]  W. Hager,et al.  Active Set Strategies and the LP Dual Active Set Algorithm1 , 1996 .

[13]  Ping-Qi Pan,et al.  A dual projective simplex method for linear programming , 1998 .

[14]  Åke Björck,et al.  Numerical Methods , 1995, Handbook of Marine Craft Hydrodynamics and Motion Control.

[15]  Donald Goldfarb,et al.  Steepest-edge simplex algorithms for linear programming , 1992, Math. Program..

[16]  Bob Hattersley,et al.  A dual approach to primal degeneracy , 1988, Math. Program..

[17]  W. Givens.  Computation of Plain Unitary Rotations Transforming a General Matrix to Triangular Form , 1958 .

[18]  Ping-Qi Pan,et al.  A projective simplex algorithm using LU decomposition , 2000 .

[19]  W. Hager.  The LP Dual Active Set Algorithm , 1998 .

[20]  Ping-Qi Pan,et al.  A projective simplex method for linear programming , 1999 .

[21]  Pingqi Pan.  A simplex-like method with bisection for linear programming 1 , 1991 .

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

[23]  A. Charnes.  Optimality and Degeneracy in Linear Programming , 1952 .