Abstract
This paper describes the evolution of an experimental implementation of the Karmarkar projective method and gives computational results for some small to medium, but realistically structured models.
This paper supersedes an earlier version entitled “An Experimental Approach to Karmarkar’s Linear Programming Algorithm.”
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Benichou, L.M. Gauthier, G. Hentges and G. Ribiere, “The efficient solution of large-scale linear programming problems—Some algorithmic techniques and computational results,” Mathematical Programming 13 (1977) 280–322.
G.B. Dantzig, Linear programming and extensions (Princeton University Press, Princeton, NJ, 1963).
A. George and M.T. Heath, “Solution of sparse linear least squares problems using Givens rotations,” Linear Algebra and its Applications 34 (1980) 69–83.
A. George and J.W.-H. Liu, Computer solution of large sparse positive definite systems (Prentice-Hall, Englewood Cliffs, NJ, 1981).
A. George and E. Ng, “A new release of SPARSPAK—The Waterloo sparse matrix package,” ACM SIGNUM Newsletter 19, number 4 (1984) 9–13.
P.E. Gill, W. Murray and M.H. Wright, Practical optimization (Academic Press, London, 1981).
G.H. Golub and C.F. Van Loan, Matrix computations (Johns Hopkins University Press, Baltimore, MD, 1983).
M.T. Heath, “Numerical methods for large sparse linear least squares problems,” SIAM Journal on Scientific and Statistical Computing 5 (1984) 497–513.
IBM Corporation, “Mathematical programming system/360, Version 2, System Manual,” Form Y20-0065-2 (White Plains, NY, 1969).
N. Karmarkar, “A new polynomial-time algorithm for linear programming,” Combinatorica 4 (1984) 373–395.
N. Karmarkar, Seminar presentations at the 18th joint ORSA/TIMS national meeting (Dallas, TX, November 1984) and at Stanford University (Stanford, CA, January, 1985).
Ketron, Inc., “MPSIII users manual,” Revision 11 (Arlington, VA, June, 1984).
G. Kolata, “A fast way to solve hard problems,” Science 225 (1984) 1379–1380.
C.C. Paige and M.A. Saunders, “LSQR: An algorithm for sparse linear equations and sparse least squares,” ACM Transactions on Mathematical Software 8 (1982) 43–71.
M. Saiidi and J.A. Tomlin, “Some computational experiments with Scolnik’s linear programming approach,” SIGMAP Newsletter 18 (1975) 30–37.
M.A. Saunders, “Large scale linear programming using the Cholesky factorization,” Technical Report STAN-CS-72-252, Computer Science Department, Stanford University (Stanford, CA, 1972).
J.A. Tomlin and J.S. Welch, “Formal optimization of some reduced linear programming problems,” Mathematical Programming 27 (1983) 232–240.
J.A. Tomlin and J.S. Welch, “Integration of a primal simplex algorithm with a large scale mathematical programming system,” ACM Transactions on Mathematical Software 11 (1985) 1–11.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 The Mathematical Programming Society, Inc.
About this chapter
Cite this chapter
Tomlin, J.A. (1987). An experimental approach to karmarkar’s projective method for linear programming. In: Hoffman, K.L., Jackson, R.H.F., Telgen, J. (eds) Computation Mathematical Programming. Mathematical Programming Studies, vol 31. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0121187
Download citation
DOI: https://doi.org/10.1007/BFb0121187
Received:
Revised:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00932-7
Online ISBN: 978-3-642-00933-4
eBook Packages: Springer Book Archive