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

A Simplified Procedure for Quadratic Programming

Author

Listed:
  • C. M. Shetty

    (The University of Leeds, England)

Abstract

The problem discussed in this paper deals with maximization (minimization) under linear restrictions, of a quadratic function of the form (1/2 X t UX + VX ) where U is negative (positive) semi definite. The optimum solution to this problem can be obtained by solving a certain enlarged system of equations representing the Kuhn-Tucker conditions. In this paper we will show that an equivalent system of equations of smaller dimensionality can be derived directly from any basic solution to the quadratic programming problem. We will also show that a variant of Wolfe's procedure for quadratic programming, which essentially uses the simplex method, can be used to solve this equivalent problem using a n × (2 n + 1) tableau giving the optimum solution in a finite number of iterations. The procedure can be programmed on a computer with minor modifications to the code for linear programming.

Suggested Citation

  • C. M. Shetty, 1963. "A Simplified Procedure for Quadratic Programming," Operations Research, INFORMS, vol. 11(2), pages 248-260, April.
    • Handle: RePEc:inm:oropre:v:11:y:1963:i:2:p:248-260
    DOI: 10.1287/opre.11.2.248
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.11.2.248
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.11.2.248?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
    ---><---

    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:11:y:1963:i:2:p:248-260. 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.