Solving quadratic programming problem via dynamic programming approach
نویسندگان
1 Department of Mathematics, College of Education, Salahaddin University-Erbil, Iraq
2 Department of Mathematics, College of Education, Salahaddin University-Erbil, Iraq
doi
10.22075/ijnaa.2021.25640.3072چکیده
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
