IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v30y2017i2p277-287.html
   My bibliography  Save this article

Bounds for convex quadratic programming problems and some important applications

Author

Listed:
  • Morteza Pakdaman
  • Sohrab Effati

Abstract

This paper proposes bounds for the objective function of convex quadratic programming problem (QPP) in general form. The method uses just the eigenvalues of the Hessian matrix. By use of the eigenvalues of the Hessian matrix and solving two simple optimisation problems, we propose an interval which contains the optimal value of QPP. This method can be useful for complicated and large scale optimisation problems as well as for the integer quadratic programming problems and also can be used as a start interval for the other existing mathematical methods for QPP. Another application of the proposed interval is to help the decision maker in real applications to estimate the bounds of the optimal solution. Thus the method is useful from both theoretical and practical approaches. This method can also be applied to solve fractional quadratic programming problems as well as for binary and mixed integer quadratic programming problems. Sensitivity analysis for the objective function is another application of the method which will be discussed. To illustrate the method, several problems are solved.

Suggested Citation

  • Morteza Pakdaman & Sohrab Effati, 2017. "Bounds for convex quadratic programming problems and some important applications," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 30(2), pages 277-287.
    • Handle: RePEc:ids:ijores:v:30:y:2017:i:2:p:277-287
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=86528
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:ids:ijores:v:30:y:2017:i:2:p:277-287. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    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.