A Procedure for Solving Quadratic Programming Problems

H. K. Das


In this paper, we study on the well-known procedure of quadratic programming (QP) and its corresponding linear programming (LP)
problem. We then introduce a LP problem corresponding to the QP problem. Unfortunately, an unboundedness question arises into the new
converting LP problem. We then modify the converted LP problem that overcomes the unboundedness. We introduce a general computer
technique that can be solved the QP problem. An example is given to clarify the procedure and the computer technique.


Linear Programming, Quadratic Programming, Karush-Kuhn-Tucker Conditions, Computer Algebra.

Full Text:



  • There are currently no refbacks.

Dhaka University Journal of Science ISSN 1022-2502 (Print) 2408-8528 (Online)