A different convergence proof of the projective method for linear programming
type: Item
instance of: scholarly article
title: A different convergence proof of the projective method for linear programming
zbMATH Open document ID: 0617.90059
DOI: 10.1016/0167-6377(86)90025-8
published in: Operations Research Letters
publication date: 1986-01-01T00:00:00Z
review text: We give a different proof of convergence of the polynomial-time algorithm for linear programming based on projective transformations.
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4001866
zbMATH Keywords: Karmarkar's algorithm
zbMATH Keywords: proof of convergence
zbMATH Keywords: polynomial-time algorithm
zbMATH Keywords: projective transformations
author: Manfred Padberg
MaRDI profile type: Publication
full work available at URL: 0167-6377(86)90025-8
OpenAlex ID: W1987920272
cites work: A new polynomial-time algorithm for linear programming
description: scientific article; zbMATH DE number 4001866