Optimization Online


On Chubanov's method for Linear Programming

Amitabh Basu(abasu***at***math.ucdavis.edu)
Jesus De Loera(deloera***at***math.ucdavis.edu)
Mark Junod(mjunod***at***math.ucdavis.edu)

Abstract: We discuss the method recently proposed by S. Chubanov for the linear feasibility problem. We present new, concise proofs and interpretations of some of his results. We then show how our proofs can be used to find strongly polynomial time algorithms for special classes of linear feasibility problems. Under certain conditions, these results provide new proofs of classical results obtained by Tardos, and Vavasis and Ye.

Keywords: Linear Programming; strongly polynomial time algorithms; relaxation methods

Category 1: Linear, Cone and Semidefinite Programming (Linear Programming )


Download: [PDF]

Entry Submitted: 04/09/2012
Entry Accepted: 04/09/2012
Entry Last Modified: 04/09/2012

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society