Munapo, Elias2019-06-112019-06-112019http://hdl.handle.net/10394/32738The general binary linear programming (BLP) problem is known to be NP Complete. The lecture presents a new approach of transforming any BLP into a convex quadratic programming (CQP) problem. It is known that the CQPs can be solved by interior point algorithms in polynomial time (P). This implies that NP=P and settles one of the controversial millennium open problemsenNP – completebinary linear programmingconvex functionconvex quadratic programming probleminterior point algorithm and polynomial timeOther