A modification of karmarkar's linear programming algorithm
We present a modification of Karmarkar's linear programming algorithm. Our algorithm uses a recentered projected gradient approach thereby obviatinga priori knowledge of the optimal objective function value. Assuming primal and dual nondegeneracy, we prove that our algorithm converges. We present computational comparisons between our algorithm and the revised simplex method. For small, dense constraint matrices we saw little difference between the two methods.
Key wordsLinear programming Karmarkar's algorithm Projected gradient methods Least squares
Unable to display preview. Download preview PDF.
- E. R. Barnes, A variation on Karmarkar's algorithm for solving linear programming problems, Manuscript, IBM T. J. Watson Research Center, Yorktown Heights, NY, 1985.Google Scholar
- T. M. Cavalier and A. L. Soyster, Some computational experience and a modification of the Karmarkar algorithm, ISME Working Paper 85–105, The Pennsylvania State University, 1985.Google Scholar
- S. C. Eisenstat, Efficient implementation of a class of preconditioned conjugate gradient methods,SIAM J. Sci. Statist. Comput.,2 (1985), 4–7.Google Scholar
- N. Megiddo, A variation on Karmarkar's algorithm, Manuscript, IBM Research Laboratory, San Jose, CA, 1985.Google Scholar
- M. J. Todd and B. P. Burrell, An extension of Karmarkar's algorithm for linear programming using dual variables, Technical Report No. 648, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY, 1985.Google Scholar
- J. A. Tomlin, An experimental approach to Karmarkar's projective method for linear programming, Manuscript, Ketron Inc., Mountain View, CA, 1985.Google Scholar