|
|
| |
| Develop A New Approach For Solving Np Hard Optimization Problem
Download PDF
|
Dr. Ahmed Hasan Al Ridha, Dr. Hiba A. Ahmed
|
Abstract:
The aim of this paper is to develop a novel approach to solve an optimization problem in a Semidefinite domain Programming. In fact, the K-CLUSTER problem has been identified as an optimization problem, which falls into the category of Np hard problems. Our technical approach is to rely on the bound of the semidefinite programming to find the bound of the optimization problem and then obtain approximate solution. In addition, the penalty method and the Lagrangian method were adopted to find the numerical results. Moreover, a hybrid method was devised that combines the two methods. The basis of its work is to pick up the solution from the faster method. Finally, highly efficient results are obtained, and the hybrid method can be adopted as a basis for solving other NP hard optimization problems.
|
|
|
| | |