| Article ID: | iaor2002477 |
| Country: | United States |
| Volume: | 112 |
| Issue: | 2/3 |
| Start Page Number: | 161 |
| End Page Number: | 170 |
| Publication Date: | Jun 2000 |
| Journal: | Applied Mathematics and Computation |
| Authors: | Mohd I.B., Dasril Y. |
In this paper, we represent a method which is based on the violated constraints by the unconstrained minimum of the objective function of the quadratic programming problem for exploring, locating and computing the optimal solution of the problem without using additional information as has been done in most of the favourite established methods.