Open AccessSolving NP-hard problem using a new relaxation of approximate methods
Author(s) -
Ahmed Hasan Alridha,
Ahmed Sabah Al-Jilawi
Publication year - 2022
Publication title -
international journal of health sciences (ijhs) (en línea)
Language(s) - English
Resource type - Journals
eISSN - 2550-6978
pISSN - 2550-696X
DOI - 10.53730/ijhs.v6ns3.5375
Subject(s) - lagrangian relaxation , relaxation (psychology) , augmented lagrangian method , mathematical optimization , convergence (economics) , lagrange multiplier , computer science , lagrangian , mathematics , penalty method , algorithm , psychology , social psychology , economics , economic growth
A new approach has been introduced for solving NP-hardness problem in combinatorial optimization problems. Actully, our study focused on the relationship between the Lagrange method and Penalty method ,this paper introduce a new relaxation of the fesible region.Furthermore, NP hard problem has been tested and showed that the Augmented Lagrangian Approach outperformed the Penalty method. Finally, our study focuses on enhancing the theoretical convergence features as well as numerical computing.