|
|
|
|
solving quadratic programming problem via dynamic programming approach
|
|
|
|
|
|
|
|
نویسنده
|
saber naghada ,sulaiman nejmaddin
|
|
منبع
|
international journal of nonlinear analysis and applications - 2022 - دوره : 13 - شماره : 2 - صفحه:473 -478
|
|
چکیده
|
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
|
|
آدرس
|
salahaddin university-erbil, college of education, department of mathematics, iraq, salahaddin university-erbil, college of education, department of mathematics, iraq
|
|
پست الکترونیکی
|
nejmaddinasulaiman@gmail.com; nejmaddin.sulaiman@su.edu.krd
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|