A Technique for Solving Special Type Quadratic Programming Problems

Abstract

Because of its usefulness in production planning, financial and corporate planning, health care and hospital planning, quadratic programming (QP) problems have attracted considerable research and interest in recent years. In this paper, we first extend the simplex method for solving QP problems by replacing one basic variable at an iteration of simplex method. We then develop an algorithm and a computer technique for solving quadratic programming problem involving the product of two indefinite factorized linear functions. For developing the technique, we use programming language MATHEMATICA. We also illustrate numerical examples to demonstrate our technique.