An Inverse-Basis Method for Beale's Quadratic Programming Algorithm
AbstractThis 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 InfoIf 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.
Bibliographic InfoArticle provided by INFORMS in its journal Management Science.
Volume (Year): 19 (1973)
Issue (Month): 5 (January)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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 references are entirely missing, you can add them using this form.