| dc.contributor.author | Munapo, Elias | |
| dc.date | | |
| dc.date.accessioned | 2019-06-11T06:48:59Z | |
| dc.date.available | 2019-06-11T06:48:59Z | |
| dc.date.issued | 2019 | |
| dc.identifier.uri | http://hdl.handle.net/10394/32738 | |
| dc.description.abstract | The 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 problems | en_US |
| dc.language | | |
| dc.language.iso | en | en_US |
| dc.publisher | North-West University (South Africa). Mahikeng Campus | en_US |
| dc.subject | NP – complete | en_US |
| dc.subject | binary linear programming | en_US |
| dc.subject | convex function | en_US |
| dc.subject | convex quadratic programming problem | en_US |
| dc.subject | interior point algorithm and polynomial time | en_US |
| dc.title | The Controversial Millennium Problem – Proof that NP=P / Elias Munapo | en_US |
| dc.type | Other | en_US |
| dc.contributor.researchID | | |
