Optimization Online


A polynomial relaxation-type algorithm for linear programming

Sergei Chubanov(sergei.chubanov***at***uni-siegen.de)

Abstract: The paper proposes a polynomial algorithm for solving systems of linear inequalities. The algorithm uses a polynomial relaxation-type procedure which either finds a solution for Ax = b, 0 <= x <= 1, or decides that the system has no integer solutions.

Keywords: Linear programming, polynomial algorithm

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


Download: [PDF]

Entry Submitted: 02/07/2011
Entry Accepted: 02/07/2011
Entry Last Modified: 02/07/2011

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 Programming Society