Canonical bases in linear programming

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

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

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

[4]  Alex Orden,et al.  Stationary points of quadratic functions under linear constraints , 1964, Comput. J..

[5]  B. Noble.  Applied Linear Algebra , 1969 .

[6]  W. Zangwill.  Nonlinear programming : a unified approach , 1972 .

[7]  Alexander Meeraus,et al.  Matrix augmentation and partitioning in the updating of the basis inverse , 1977, Math. Program..

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

[9]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[10]  Donald Goldfarb,et al.  A practicable steepest-edge simplex algorithm , 1977, Math. Program..

[11]  Evan L. Porteus,et al.  A class of methods for linear programming , 1978, Math. Program..

[12]  Michael A. Saunders,et al.  Large-scale linearly constrained optimization , 1978, Math. Program..

[13]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[14]  P. Gill,et al.  Sparse Matrix Methods in Optimization , 1984 .

[15]  A. Barrett.  Network Flows and Monotropic Optimization. , 1984 .

[16]  M. Heath,et al.  An algorithm to compute a sparse basis of the null space , 1985 .

[17]  T. Coleman,et al.  The null space problem I. complexity , 1986 .

[18]  Adi Ben-Israel.  A ℤ-Simplex Algorithm with partial updates , 1987 .