IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v73y2019i4d10.1007_s10898-018-00736-z.html
   My bibliography  Save this article

Lifted polymatroid inequalities for mean-risk optimization with indicator variables

Author

Listed:
  • Alper Atamtürk

    (University of California)

  • Hyemin Jeon

    (University of California)

Abstract

We investigate a mixed 0–1 conic quadratic optimization problem with indicator variables arising in mean-risk optimization. The indicator variables are often used to model non-convexities such as fixed charges or cardinality constraints. Observing that the problem reduces to a submodular function minimization for its binary restriction, we derive three classes of strong convex valid inequalities by lifting the polymatroid inequalities on the binary variables. Computational experiments demonstrate the effectiveness of the inequalities in strengthening the convex relaxations and, thereby, improving the solution times for mean-risk problems with fixed charges and cardinality constraints significantly.

Suggested Citation

  • Alper Atamtürk & Hyemin Jeon, 2019. "Lifted polymatroid inequalities for mean-risk optimization with indicator variables," Journal of Global Optimization, Springer, vol. 73(4), pages 677-699, April.
    • Handle: RePEc:spr:jglopt:v:73:y:2019:i:4:d:10.1007_s10898-018-00736-z
    DOI: 10.1007/s10898-018-00736-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-018-00736-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-018-00736-z?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.

    References listed on IDEAS

    as
    1. P. Bonami & M. A. Lejeune, 2009. "An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints," Operations Research, INFORMS, vol. 57(3), pages 650-670, June.
    2. Laurent El Ghaoui & Maksim Oks & Francois Oustry, 2003. "Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach," Operations Research, INFORMS, vol. 51(4), pages 543-556, August.
    3. Pierre Bonami & Miguel A. Lejeune, 2009. "An Exact Solution Approach for Integer Constrained Portfolio Optimization Problems Under Stochastic Constraints," Post-Print hal-00421756, HAL.
    4. Svatopluk Poljak & Henry Wolkowicz, 1995. "Convex Relaxations of (0, 1)-Quadratic Programming," Mathematics of Operations Research, INFORMS, vol. 20(3), pages 550-561, August.
    5. ,, 2000. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 16(2), pages 287-299, April.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Alper Atamtürk & Carlos Deck & Hyemin Jeon, 2020. "Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 346-355, April.
    2. Andrés Gómez & Oleg A. Prokopyev, 2021. "A Mixed-Integer Fractional Optimization Approach to Best Subset Selection," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 551-565, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Martin Branda & Max Bucher & Michal Červinka & Alexandra Schwartz, 2018. "Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization," Computational Optimization and Applications, Springer, vol. 70(2), pages 503-530, June.
    2. Jongbin Jung & Seongmoon Kim, 2017. "Developing a dynamic portfolio selection model with a self-adjusted rebalancing method," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(7), pages 766-779, July.
    3. Wenqing Chen & Melvyn Sim & Jie Sun & Chung-Piaw Teo, 2010. "From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization," Operations Research, INFORMS, vol. 58(2), pages 470-485, April.
    4. Miguel A. Lejeune & François Margot, 2016. "Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities," Operations Research, INFORMS, vol. 64(4), pages 939-957, August.
    5. Xueting Cui & Xiaoling Sun & Shushang Zhu & Rujun Jiang & Duan Li, 2018. "Portfolio Optimization with Nonparametric Value at Risk: A Block Coordinate Descent Method," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 454-471, August.
    6. Panos Xidonas & Christis Hassapis & George Mavrotas & Christos Staikouras & Constantin Zopounidis, 2018. "Multiobjective portfolio optimization: bridging mathematical theory with asset management practice," Annals of Operations Research, Springer, vol. 267(1), pages 585-606, August.
    7. Dimitris Bertsimas & Ryan Cory-Wright, 2022. "A Scalable Algorithm for Sparse Portfolio Selection," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1489-1511, May.
    8. Amir Ahmadi-Javid & Pooya Hoseinpour, 2022. "Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2621-2633, September.
    9. Ran Ji & Miguel A. Lejeune, 2021. "Data-Driven Optimization of Reward-Risk Ratio Measures," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1120-1137, July.
    10. Murray, Chase C. & Talukdar, Debabrata & Gosavi, Abhijit, 2010. "Joint Optimization of Product Price, Display Orientation and Shelf-Space Allocation in Retail Category Management," Journal of Retailing, Elsevier, vol. 86(2), pages 125-136.
    11. Zhang, Bo & Yao, Tao & Friesz, Terry L. & Sun, Yuqi, 2015. "A tractable two-stage robust winner determination model for truckload service procurement via combinatorial auctions," Transportation Research Part B: Methodological, Elsevier, vol. 78(C), pages 16-31.
    12. Zhi-Hai Zhang & Kang Li, 2015. "A novel probabilistic formulation for locating and sizing emergency medical service stations," Annals of Operations Research, Springer, vol. 229(1), pages 813-835, June.
    13. Ran Ji & Miguel A. Lejeune, 2018. "Risk-budgeting multi-portfolio optimization with portfolio and marginal risk constraints," Annals of Operations Research, Springer, vol. 262(2), pages 547-578, March.
    14. Tao Yao & Supreet Mandala & Byung Chung, 2009. "Evacuation Transportation Planning Under Uncertainty: A Robust Optimization Approach," Networks and Spatial Economics, Springer, vol. 9(2), pages 171-189, June.
    15. Gianfranco Guastaroba & Gautam Mitra & M Grazia Speranza, 2011. "Investigating the effectiveness of robust portfolio optimization techniques," Journal of Asset Management, Palgrave Macmillan, vol. 12(4), pages 260-280, September.
    16. Fridman, Ilia & Pesch, Erwin & Shafransky, Yakov, 2020. "Minimizing maximum cost for a single machine under uncertainty of processing times," European Journal of Operational Research, Elsevier, vol. 286(2), pages 444-457.
    17. Zhang, Zhi-Hai & Unnikrishnan, Avinash, 2016. "A coordinated location-inventory problem in closed-loop supply chain," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 127-148.
    18. Xiaojin Zheng & Xiaoling Sun & Duan Li, 2014. "Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 690-703, November.
    19. Eduardo Bered Fernandes Vieira & Tiago Pascoal Filomena, 2020. "Liquidity Constraints for Portfolio Selection Based on Financial Volume," Computational Economics, Springer;Society for Computational Economics, vol. 56(4), pages 1055-1077, December.
    20. Soleimanian, Azam & Salmani Jajaei, Ghasemali, 2013. "Robust nonlinear optimization with conic representable uncertainty set," European Journal of Operational Research, Elsevier, vol. 228(2), pages 337-344.

    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:spr:jglopt:v:73:y:2019:i:4:d:10.1007_s10898-018-00736-z. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.