Solving quadratic programming problem via dynamic programming approach | ||
| International Journal of Nonlinear Analysis and Applications | ||
| مقاله 42، دوره 13، شماره 2، مهر 2022، صفحه 473-478 اصل مقاله (325.77 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22075/ijnaa.2021.25640.3072 | ||
| نویسندگان | ||
| Naghada S. Saber* ؛ Nejmaddin A. Sulaiman | ||
| Department of Mathematics, College of Education, Salahaddin University-Erbil, Iraq | ||
| چکیده | ||
| In this paper, we define the dynamic programming approach to solve quadratic programming problem when the objective function can be written as the product of two linear factors with single linear constraint. An algorithm is proposed for solving such problems, we also solved the problems by simplex method to obtained the exact solution as dynamic programming technique. To demonstrate our proposed method, numerical examples are also illustrated | ||
| کلیدواژهها | ||
| Quadratic Programming Problem؛ Dynamic Programming Approach؛ Optimal Solution | ||
| مراجع | ||
|
| ||
|
آمار تعداد مشاهده مقاله: 44,734 تعداد دریافت فایل اصل مقاله: 52,008 |
||
| تعداد نشریات | 22 |
| تعداد شمارهها | 732 |
| تعداد مقالات | 10,569 |
| تعداد مشاهده مقاله | 73,814,569 |
| تعداد دریافت فایل اصل مقاله | 65,321,484 |