The Indefinite Quadratic Programming Problem

Paul F. Kough
Additional contact information
Paul F. Kough: Oakland, California

Operations Research, 1979, vol. 27, issue 3, 516-533

Abstract: We develop several algorithms that obtain the global optimum to the indefinite quadratic programming problem. A generalized Benders cut method is employed. These algorithms all possess ϵ-finite convergence. To obtain finite convergence, we develop exact cuts, which are locally precise representations of a reduced objective. A finite algorithm is then constructed. Introductory computational results are presented.

Date: 1979
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.27.3.516 (application/pdf)

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: https://EconPapers.repec.org/RePEc:inm:oropre:v:27:y:1979:i:3:p:516-533

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().