TITLE:
Solving the Binary Linear Programming Model in Polynomial Time
AUTHORS:
Elias Munapo
KEYWORDS:
NP-Complete, Binary Linear Programming, Convex Function, Convex Quadratic Programming Problem, Interior Point Algorithm and Polynomial Time
JOURNAL NAME:
American Journal of Operations Research,
Vol.6 No.1,
January
11,
2016
ABSTRACT: The paper presents a technique for solving the binary linear programming model in polynomial time. The general binary linear programming problem is transformed into a convex quadratic programming problem. The convex quadratic programming problem is then solved by interior point algorithms. This settles one of the open problems of whether P = NP or not. The worst case complexity of interior point algorithms for the convex quadratic problem is polynomial. It can also be shown that every liner integer problem can be converted into binary linear problem.