American Journal of Operations Research

Volume 2, Issue 3 (September 2012)

ISSN Print: 2160-8830   ISSN Online: 2160-8849

Google-based Impact Factor: 0.84  Citations  

Minimizing Complementary Pivots in a Simplex-Based Solution Method for a Quadratic Programming Problem

HTML  Download Download as PDF (Size: 176KB)  PP. 308-312  
DOI: 10.4236/ajor.2012.23037    6,042 Downloads   9,670 Views  Citations
Author(s)

ABSTRACT

The paper presents an approach for avoiding and minimizing the complementary pivots in a simplex based solution method for a quadratic programming problem. The linearization of the problem is slightly changed so that the simplex or interior point methods can solve with full speed. This is a big advantage as a complementary pivot algorithm will take roughly eight times as longer time to solve a quadratic program than the full speed simplex-method solving a linear problem of the same size. The strategy of the approach is in the assumption that the solution of the quadratic programming problem is near the feasible point closest to the stationary point assuming no constraints.

Share and Cite:

E. Munapo, "Minimizing Complementary Pivots in a Simplex-Based Solution Method for a Quadratic Programming Problem," American Journal of Operations Research, Vol. 2 No. 3, 2012, pp. 308-312. doi: 10.4236/ajor.2012.23037.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.