We are in the process of upgrading DSpace and are restricting logins.

Show simple item record

dc.contributor.authorMunapo, Elias
dc.date
dc.date.accessioned2019-06-11T06:48:59Z
dc.date.available2019-06-11T06:48:59Z
dc.date.issued2019
dc.identifier.urihttp://hdl.handle.net/10394/32738
dc.description.abstractThe 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 problemsen_US
dc.language
dc.language.isoenen_US
dc.publisherNorth-West University (South Africa). Mahikeng Campusen_US
dc.subjectNP – completeen_US
dc.subjectbinary linear programmingen_US
dc.subjectconvex functionen_US
dc.subjectconvex quadratic programming problemen_US
dc.subjectinterior point algorithm and polynomial timeen_US
dc.titleThe Controversial Millennium Problem – Proof that NP=P / Elias Munapoen_US
dc.typeOtheren_US
dc.contributor.researchID


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record