Advanced Search
MyIDEAS: Login to save this article or follow this journal

An Inverse-Basis Method for Beale's Quadratic Programming Algorithm


Author Info

  • A. H. Land

    (The London School of Economics and Political Science)

  • G. Morton

    (University of Konstanz, Germany)

Registered author(s):


    This paper presents a version of Beale's Quadratic Programming Algorithm [Beale, E. M. L. 1959. On quadratic programming. Naval Res. Logist. Quart. 6 227-243; Beale, E. M. L. 1967. Numerical methods. J. Abadie, ed. Nonlinear Programming. Amsterdam.] for solving a problem of maximising a quadratic function under linear constraints. The modification discussed here makes it possible to retain the "inverse basis" tableau which has to be augmented by additional constraints to be called "auxiliary." The algorithm has been successfully tested on a computer.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL:
    Download Restriction: no

    Bibliographic Info

    Article provided by INFORMS in its journal Management Science.

    Volume (Year): 19 (1973)
    Issue (Month): 5 (January)
    Pages: 510-516

    as in new window
    Handle: RePEc:inm:ormnsc:v:19:y:1973:i:5:p:510-516

    Contact details of provider:
    Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA
    Phone: +1-443-757-3500
    Fax: 443-757-3515
    Web page:
    More information through EDIRC

    Related research



    No references listed on IDEAS
    You can help add them by filling out this form.



    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.


    Access and download statistics


    When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:19:y:1973:i:5:p:510-516. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

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