IDEAS home Printed from https://ideas.repec.org/p/ems/eureir/1375.html
   My bibliography  Save this paper

Sensitivity Analysis in (Degenerate) Quadratic Programming

Author

Listed:
  • Berkelaar, A.B.
  • Jansen, B.
  • Roos, K.
  • Terlaky, T.

Abstract

In this paper we deal with sensitivity analysis in convex quadratic programming, without making assumptions on nondegeneracy, strict convexity of the objective function, and the existence of a strictly complementary solution. We show that the optimal value as a function of a right--hand side element (or an element of the linear part of the objective) is piecewise quadratic, where the pieces can be characterized by maximal complementary solutions and tripartitions. Further, we investigate differentiability of this function. A new algorithm to compute the optimal value function is proposed. Finally, we discuss the advantages of this approach when applied to mean--variance portfolio models.

Suggested Citation

  • Berkelaar, A.B. & Jansen, B. & Roos, K. & Terlaky, T., 1996. "Sensitivity Analysis in (Degenerate) Quadratic Programming," Econometric Institute Research Papers EI 9611-/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
  • Handle: RePEc:ems:eureir:1375
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Berkelaar, A.B. & Roos, K. & Terlaky, T., 1996. "The Optimal Set and Optimal Partition Approach to Linear and Quadratic Programming," Econometric Institute Research Papers EI 9658-/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    2. E. A. Yildirim, 2004. "Unifying Optimal Partition Approach to Sensitivity Analysis in Conic Optimization," Journal of Optimization Theory and Applications, Springer, vol. 122(2), pages 405-423, August.
    3. Haibing Lu & Jaideep Vaidya & Vijayalakshmi Atluri & Yingjiu Li, 2015. "Statistical Database Auditing Without Query Denial Threat," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 20-34, February.

    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:ems:eureir:1375. 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: RePub (email available below). General contact details of provider: https://edirc.repec.org/data/feeurnl.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.