Optimization Online


A strongly polynomial algorithm for linear optimization problems having 0-1 optimal solutions

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

Abstract: We present a strongly polynomial algorithm for linear optimization problems of the form min{cx|Ax = b, x >= 0} having 0-1 vectors among their optimal solutions. The algorithm runs in time O(n^4*max\{m,log n}), where n is the number of variables and m is the number of equations. The algorithm also constructs necessary and sufficient optimality conditions for 0-1 solutions in the form of a linear system.

Keywords: Linear programming, strongly polynomial algorithm

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


Download: [PDF]

Entry Submitted: 01/06/2014
Entry Accepted: 01/06/2014
Entry Last Modified: 01/24/2014

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