Padberg, Manfred A different convergence proof of the projective method for linear programming. (English) Zbl 0617.90059 Oper. Res. Lett. 4, 253-257 (1986). We give a different proof of convergence of the polynomial-time algorithm for linear programming based on projective transformations. Cited in 1 ReviewCited in 11 Documents MSC: 90C05 Linear programming 65K05 Numerical mathematical programming methods 68Q25 Analysis of algorithms and problem complexity Keywords:Karmarkar’s algorithm; proof of convergence; polynomial-time algorithm; projective transformations PDF BibTeX XML Cite \textit{M. Padberg}, Oper. Res. Lett. 4, 253--257 (1986; Zbl 0617.90059) Full Text: DOI OpenURL References: [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.