IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v27y1979i3p516-533.html
   My bibliography  Save this article

The Indefinite Quadratic Programming Problem

Author

Listed:
  • Paul F. Kough

    (Oakland, California)

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.

Suggested Citation

  • Paul F. Kough, 1979. "The Indefinite Quadratic Programming Problem," Operations Research, INFORMS, vol. 27(3), pages 516-533, June.
    • Handle: RePEc:inm:oropre:v:27:y:1979:i:3:p:516-533
    DOI: 10.1287/opre.27.3.516
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.27.3.516
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.27.3.516?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Pierre Hansen & Brigitte Jaumard & MichèLe Ruiz & Junjie Xiong, 1993. "Global minimization of indefinite quadratic functions subject to box constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(3), pages 373-392, April.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:27:y:1979:i:3:p:516-533. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.