Abstract
A specialization of the projective method for linear programming to problems with lower and upper bounds on the variables is proposed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K. M. Anstreicher, Analysis of a modified Karmarkar algorithm for linear programming, Preprint, Yale School of Organization and Management, 1985.
N. Karmarkar, A new polynomial-time algorithm for linear programming,Combinatorica,4 (1984), 373–395.
M. Padberg, A different convergence proof of the projective method for linear programming,Oper. Res. Lett.,6 (1986), 253–257.
M. Padberg, Solution of a nonlinear programming problem arising in the projective method, Preprint, New York University, March 1985 (to appear inSIAM J. Control Optim.).
M. J. Todd and B. P. Burrel, An extension of Karmarkar's algorithm for linear programming using dual variables, Technical Report No. 648, School of Operations Research and Industrial Engineering, College of Engineering, Cornell University, 1985.
J. A. Tomlin, An experimental approach to Karmarkar's projective method for linear programming, Preprint, Ketron Inc., 1985.
Author information
Authors and Affiliations
Additional information
Communicated by Nimrod Megiddo.
This work was done while the author was visiting New York University.
Rights and permissions
About this article
Cite this article
Rinaldi, G. A projective method for linear programming with box-type constraints. Algorithmica 1, 517–527 (1986). https://doi.org/10.1007/BF01840460
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01840460