Basis- and tripartition identification for quadratic programming and linear complementarity problems: from an interior solution to an optimal basis and viceversa

Arjan B. Berkelaar
Additional contact information
Arjan B. Berkelaar: Econometric Institute, Erasmus University Rotterdam

No 27, Econometric Institute Report from Erasmus University Rotterdam, Econometric Institute

Abstract: Optimal solutions of interior point algorithms for linear and quadratic programming and linear complementarity problems provide maximal complementary solutions. Maximal complementary solutions can be characterized by optimal (tri)partitions. On the other hand, the solutions provided by simplex--based pivot algorithms are given in terms of complementary bases. A basis identification algorithm is an algorithm which generates a complementary basis, starting from any complementary solution. A tripartition identification algorithm is an algorithm which generates a maximal complementary solution (and its corresponding tripartition), starting from any complementary solution. In linear programming such algorithms were respectively proposed by Megiddo in 1991 and Balinski and Tucker in 1969. In this paper we will present identification algorithms for quadratic programming and linear complementarity problems with sufficient matrices. The presented algorithms are based on the principal pivot transform and the orthogonality property of basis tableaus.

Date: 1996
View list of references

Downloads: (external link)
http://www.eur.nl/WebDOC/doc/econometrie/eeb19960111120028.ps (application/postscript)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: http://EconPapers.repec.org/RePEc:dgr:eureir:199727

Access Statistics for this paper

More papers in Econometric Institute Report from Erasmus University Rotterdam, Econometric Institute
Series data maintained by Anneke Kop ().