A dual projective simplex method for linear programming

The method proposed in this paper is a dual version of the projective simplex method, developed by the author. Providing a stable alternative setting for the dual simplex method, by handling a sequence of linear least squares problems using orthogonalization, the method is capable of handling a basis with columns fewer than rows of the coefficient matrix, and amenable to problems with n − m large relative to m, a wide range of problems with which the projective simplex method performs unsatisfactorily, in general. Based on a plausible characterization of an optimal solution, a dual crash heuristic is described to produce an initial “good” basis. Computational results obtained with a set of standard test problems from NETLIB are very encouraging.

[1]  S. Hammarling.  A Note on Modifications to the Givens Plane Rotation , 1974 .

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

[3]  Mark A. Schulze,et al.  Linear Programming for Optimization , 1998 .

[4]  Ping-Qi Pan,et al.  A Variant of the Dual Pivoting Rule in Linear Programming , 1994 .

[5]  Harvey J. Greenberg,et al.  Design and implementation of optimization software , 1977, Math. Program..

[6]  Ping-Qi Pan.  The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study , 1997 .

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

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

[9]  D. Bartholomew,et al.  Linear Programming: Methods and Applications , 1970 .

[10]  G. Stewart,et al.  Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization , 1976 .

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

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

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

[14]  Harvey J. Greenberg,et al.  Pivot Selection Tactics , 1978 .

[15]  D. Goldfarb.  Factorized variable metric methods for unconstrained optimization , 1976 .

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

[17]  G. Stewart.  The economical storage of plane rotations , 1976 .

[18]  P. Gill,et al.  Methods for computing and modifying the $LDV$ factors of a matrix , 1975 .

[19]  Shu-Cherng Fang,et al.  Linear Optimization and Extensions: Theory and Algorithms , 1993 .

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

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

[22]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[23]  C. E. Lemke,et al.  The dual method of solving the linear programming problem , 1954 .