A different convergence proof of the projective method for linear programming. (English) Zbl 0617.90059

We give a different proof of convergence of the polynomial-time algorithm for linear programming based on projective transformations.


90C05 Linear programming
65K05 Numerical mathematical programming methods
68Q25 Analysis of algorithms and problem complexity
Full Text: DOI


[1] Courant, R.; Robbins, H., What Is mathematics?, (1941), Oxford University Press New York, (paperback, 1978) · JFM 67.0001.05
[2] Karmarkar, N., A new polynomial-time algorithm for linear programming, Combinatorica, 4, 373-395, (1984) · Zbl 0557.90065
[3] Padberg, M., Solution of a nonlinear programming problem arising in the projective method, (1985), New York University, Preprint
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.