A Procedure for Solving Quadratic Programming Problems

Authors

  • HK Das Department of Mathematics, Dhaka University, Dhaka-1000, Bangladesh

DOI:

https://doi.org/10.3329/dujs.v65i1.54499

Keywords:

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

Abstract

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.

Dhaka Univ. J. Sci. 65(1): 9-13, 2017 (January)

Downloads

Download data is not yet available.
Abstract
21
PDF
22

Downloads

Published

2017-01-05

How to Cite

Das, H. (2017). A Procedure for Solving Quadratic Programming Problems. Dhaka University Journal of Science, 65(1), 9–13. https://doi.org/10.3329/dujs.v65i1.54499

Issue

Vol. 65 No. 1 (2017)

Section

Articles