IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v30y2013i03ns0217595913400095.html
   My bibliography  Save this article

An Improved Convex 0-1 Quadratic Program Reformulation For Chance-Constrained Quadratic Knapsack Problems

Author

Listed:
  • SHUHUI JI

    (Department of Research and Development, Bank of Communications, No. 18 Xianxia Road, Shanghai 200336, P. R. China)

  • XIAOJIN ZHENG

    (School of Economics and Management, Tongji University, Shanghai 200092, P. R. China)

  • XIAOLING SUN

    (Department of Management Science, School of Management, Fudan University, Shanghai 200433, P. R. China)

Abstract

We consider a chance-constrained quadratic knapsack problem (CQKP) where each item has a random size that is finitely distributed. We present a new convex 0-1 quadratic program reformulation for CQKP. This new reformulation improves the existing reformulation for general 0-1 quadratic program based on diagonal perturbation in the sense that the continuous relaxation of the new reformulation is tighter than or at least as tight as that of the existing reformulation. The improved reformulation is derived from a general matrix decomposition of the objective function and piecewise linearization of 0-1 variables. We show that the optimal parameters in the improved reformulation can be obtained by solving an SDP problem. Extension to k-item probabilistic quadratic knapsack problems is also discussed. Preliminary comparison results are reported to demonstrate the effectiveness of the improved reformulation.

Suggested Citation

  • Shuhui Ji & Xiaojin Zheng & Xiaoling Sun, 2013. "An Improved Convex 0-1 Quadratic Program Reformulation For Chance-Constrained Quadratic Knapsack Problems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 30(03), pages 1-17.
    • Handle: RePEc:wsi:apjorx:v:30:y:2013:i:03:n:s0217595913400095
    DOI: 10.1142/S0217595913400095
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595913400095
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595913400095?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
    ---><---

    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:wsi:apjorx:v:30:y:2013:i:03:n:s0217595913400095. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.