The Controversial Millennium Problem – Proof that NP=P / Elias Munapo
Loading...
Files
Date
2019
Authors
Munapo, Elias
Supervisors
Journal Title
Journal ISSN
Volume Title
Publisher
North-West University (South Africa). Mahikeng Campus
Record Identifier
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
Sustainable Development Goals
Description
Keywords
NP – complete, binary linear programming, convex function, convex quadratic programming problem, interior point algorithm and polynomial time