IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v81y2021i4d10.1007_s10898-021-01038-7.html
   My bibliography  Save this article

A geometric branch and bound method for robust maximization of convex functions

Author

Listed:
  • Fengqiao Luo

    (Northwestern University)

  • Sanjay Mehrotra

    (Northwestern University)

Abstract

We investigate robust optimization problems defined for maximizing convex functions. While the problems arise in situations which are naturally modeled as minimization of concave functions, they also arise when a decision maker takes an optimistic approach to making decisions with convex functions. For finite uncertainty set, we develop a geometric branch-and-bound algorithmic approach to solve this problem. The geometric branch-and-bound algorithm performs sequential piecewise-linear approximations of the convex objective, and solves linear programs to determine lower and upper bounds at each node. Finite convergence of the algorithm to an $$\epsilon -$$ ϵ - optimal solution is proved. Numerical results are used to discuss the performance of the developed algorithm. The algorithm developed in this paper can be used as an oracle in the cutting surface method for solving robust optimization problems with compact ambiguity sets.

Suggested Citation

  • Fengqiao Luo & Sanjay Mehrotra, 2021. "A geometric branch and bound method for robust maximization of convex functions," Journal of Global Optimization, Springer, vol. 81(4), pages 835-859, December.
    • Handle: RePEc:spr:jglopt:v:81:y:2021:i:4:d:10.1007_s10898-021-01038-7
    DOI: 10.1007/s10898-021-01038-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-021-01038-7
    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-021-01038-7?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. Benson, Harold P., 2006. "Fractional programming with convex quadratic forms and functions," European Journal of Operational Research, Elsevier, vol. 173(2), pages 351-369, September.
    2. Peter Kirst & Oliver Stein & Paul Steuermann, 2015. "Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(2), pages 591-616, July.
    3. H. P. Benson, 2007. "Solving Sum of Ratios Fractional Programs via Concave Minimization," Journal of Optimization Theory and Applications, Springer, vol. 135(1), pages 1-17, October.
    4. Yongzhen Li & Jia Shu & Miao Song & Jiawei Zhang & Huan Zheng, 2017. "Multisourcing Supply Network Design: Two-Stage Chance-Constrained Model, Tractable Approximations, and Computational Results," INFORMS Journal on Computing, INFORMS, vol. 29(2), pages 287-300, May.
    5. Lakshman S. Thakur, 1991. "Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Objective Over a Polyhedron," Mathematics of Operations Research, INFORMS, vol. 16(2), pages 390-407, May.
    6. Benson, Harold P., 2007. "A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem," European Journal of Operational Research, Elsevier, vol. 182(2), pages 597-611, October.
    7. Zuo-Jun Max Shen & Collette Coullard & Mark S. Daskin, 2003. "A Joint Location-Inventory Model," Transportation Science, INFORMS, vol. 37(1), pages 40-55, February.
    8. D. Gerard & M. Köppe & Q. Louveaux, 2017. "Guided dive for the spatial branch-and-bound," Journal of Global Optimization, Springer, vol. 68(4), pages 685-711, August.
    9. A. Ben-Tal & A. Nemirovski, 1998. "Robust Convex Optimization," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 769-805, November.
    Full references (including those not matched with items on IDEAS)

    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. Luo, Fengqiao & Mehrotra, Sanjay, 2019. "Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models," European Journal of Operational Research, Elsevier, vol. 278(1), pages 20-35.
    2. Gülpınar, Nalan & Pachamanova, Dessislava & Çanakoğlu, Ethem, 2013. "Robust strategies for facility location under uncertainty," European Journal of Operational Research, Elsevier, vol. 225(1), pages 21-35.
    3. Yongzhen Li & Jia Shu & Miao Song & Jiawei Zhang & Huan Zheng, 2017. "Multisourcing Supply Network Design: Two-Stage Chance-Constrained Model, Tractable Approximations, and Computational Results," INFORMS Journal on Computing, INFORMS, vol. 29(2), pages 287-300, May.
    4. Ng, Tsan Sheng & Sun, Yang & Fowler, John, 2010. "Semiconductor lot allocation using robust optimization," European Journal of Operational Research, Elsevier, vol. 205(3), pages 557-570, September.
    5. Alper Atamtürk & Andrés Gómez, 2020. "Submodularity in Conic Quadratic Mixed 0–1 Optimization," Operations Research, INFORMS, vol. 68(2), pages 609-630, March.
    6. Ho-Yin Mak & Ying Rong & Zuo-Jun Max Shen, 2013. "Infrastructure Planning for Electric Vehicles with Battery Swapping," Management Science, INFORMS, vol. 59(7), pages 1557-1575, July.
    7. Christina Büsing & Sigrid Knust & Xuan Thanh Le, 2018. "Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 339-365, December.
    8. 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.
    9. Zhi Chen & Melvyn Sim & Huan Xu, 2019. "Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets," Operations Research, INFORMS, vol. 67(5), pages 1328-1344, September.
    10. Stefan Mišković, 2017. "A VNS-LP algorithm for the robust dynamic maximal covering location problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(4), pages 1011-1033, October.
    11. Buchheim, Christoph & Crama, Yves & Rodríguez-Heck, Elisabeth, 2019. "Berge-acyclic multilinear 0–1 optimization problems," European Journal of Operational Research, Elsevier, vol. 273(1), pages 102-107.
    12. Chuong, T.D. & Jeyakumar, V., 2017. "Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications," Applied Mathematics and Computation, Elsevier, vol. 315(C), pages 381-399.
    13. Minjiao Zhang & Simge Küçükyavuz & Saumya Goel, 2014. "A Branch-and-Cut Method for Dynamic Decision Making Under Joint Chance Constraints," Management Science, INFORMS, vol. 60(5), pages 1317-1333, May.
    14. Lin, Yun Hui & Wang, Yuan & He, Dongdong & Lee, Loo Hay, 2020. "Last-mile delivery: Optimal locker location under multinomial logit choice model," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    15. Chassein, André & Dokka, Trivikram & Goerigk, Marc, 2019. "Algorithms and uncertainty sets for data-driven robust shortest path problems," European Journal of Operational Research, Elsevier, vol. 274(2), pages 671-686.
    16. Dranichak, Garrett M. & Wiecek, Margaret M., 2019. "On highly robust efficient solutions to uncertain multiobjective linear programs," European Journal of Operational Research, Elsevier, vol. 273(1), pages 20-30.
    17. M. J. Naderi & M. S. Pishvaee, 2017. "Robust bi-objective macroscopic municipal water supply network redesign and rehabilitation," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 31(9), pages 2689-2711, July.
    18. Sainathuni, Bhanuteja & Parikh, Pratik J. & Zhang, Xinhui & Kong, Nan, 2014. "The warehouse-inventory-transportation problem for supply chains," European Journal of Operational Research, Elsevier, vol. 237(2), pages 690-700.
    19. Evers, L. & Dollevoet, T.A.B. & Barros, A.I. & Monsuur, H., 2011. "Robust UAV Mission Planning," Econometric Institute Research Papers EI 2011-07, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    20. Vaughn Gambeta & Roy Kwon, 2020. "Risk Return Trade-Off in Relaxed Risk Parity Portfolio Optimization," JRFM, MDPI, vol. 13(10), pages 1-28, October.

    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:81:y:2021:i:4:d:10.1007_s10898-021-01038-7. 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.