IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v59y2011i4p973-985.html
   My bibliography  Save this article

Robust Optimization Made Easy with ROME

Author

Listed:
  • Joel Goh

    (Stanford Graduate School of Business; NUS Business School, National University of Singapore, Singapore 119245, Republic of Singapore)

  • Melvyn Sim

    (NUS Business School and NUS Risk Management Institute, National University of Singapore, Singapore 119245, Republic of Singapore)

Abstract

We introduce ROME, an algebraic modeling toolbox for a class of robust optimization problems. ROME serves as an intermediate layer between the modeler and optimization solver engines, allowing modelers to express robust optimization problems in a mathematically meaningful way. In this paper, we discuss how ROME can be used to model (1) a service-constrained robust inventory management problem, (2) a project-crashing problem, and (3) a robust portfolio optimization problem. Through these modeling examples, we highlight the key features of ROME that allow it to expedite the modeling and subsequent numerical analysis of robust optimization problems. ROME is freely distributed for academic use at http://www.robustopt.com.

Suggested Citation

  • Joel Goh & Melvyn Sim, 2011. "Robust Optimization Made Easy with ROME," Operations Research, INFORMS, vol. 59(4), pages 973-985, August.
    • Handle: RePEc:inm:oropre:v:59:y:2011:i:4:p:973-985
    DOI: 10.1287/opre.1110.0944
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1110.0944
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1110.0944?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
    ---><---

    References listed on IDEAS

    as
    1. Herroelen, Willy & Leus, Roel, 2005. "Project scheduling under uncertainty: Survey and research potentials," European Journal of Operational Research, Elsevier, vol. 165(2), pages 289-306, September.
    2. Chamberlain, Gary, 1983. "A characterization of the distributions that imply mean--Variance utility functions," Journal of Economic Theory, Elsevier, vol. 29(1), pages 185-201, February.
    3. Robert Fourer & David M. Gay & Brian W. Kernighan, 1990. "A Modeling Language for Mathematical Programming," Management Science, INFORMS, vol. 36(5), pages 519-554, May.
    4. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    5. Dimitris Bertsimas & Dan A. Iancu & Pablo A. Parrilo, 2010. "Optimality of Affine Policies in Multistage Robust Optimization," Mathematics of Operations Research, INFORMS, vol. 35(2), pages 363-394, May.
    6. Robert Fourer & Leo Lopes, 2009. "StAMPL: A Filtration-Oriented Modeling Tool for Multistage Stochastic Recourse Problems," INFORMS Journal on Computing, INFORMS, vol. 21(2), pages 242-256, May.
    7. G. D. Johnson & H. E. Thompson, 1975. "Optimality of Myopic Inventory Policies for Certain Dependent Demand Processes," Management Science, INFORMS, vol. 21(11), pages 1303-1307, July.
    8. Christian Valente & Gautam Mitra & Mustapha Sadki & Robert Fourer, 2009. "Extending Algebraic Modelling Languages for Stochastic Programming," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 107-122, February.
    9. Philippe Artzner & Freddy Delbaen & Jean‐Marc Eber & David Heath, 1999. "Coherent Measures of Risk," Mathematical Finance, Wiley Blackwell, vol. 9(3), pages 203-228, July.
    10. J. Tobin, 1958. "Liquidity Preference as Behavior Towards Risk," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 25(2), pages 65-86.
    11. Erick Delage & Yinyu Ye, 2010. "Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems," Operations Research, INFORMS, vol. 58(3), pages 595-612, June.
    12. Kevin H. Shang & Jing-Sheng Song, 2006. "A Closed-Form Approximation for Serial Inventory Systems and Its Application to System Design," Manufacturing & Service Operations Management, INFORMS, vol. 8(4), pages 394-406, September.
    13. Richard M. Van Slyke, 1963. "Letter to the Editor---Monte Carlo Methods and the PERT Problem," Operations Research, INFORMS, vol. 11(5), pages 839-860, October.
    14. Xin Chen & Yuhan Zhang, 2009. "Uncertain Linear Programs: Extended Affinely Adjustable Robust Counterparts," Operations Research, INFORMS, vol. 57(6), pages 1469-1482, December.
    15. A. L. Soyster, 1973. "Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming," Operations Research, INFORMS, vol. 21(5), pages 1154-1157, October.
    16. Robert Fourer & Leo Lopes, 2006. "A management system for decompositions in stochastic programming," Annals of Operations Research, Springer, vol. 142(1), pages 99-118, February.
    17. A. Ben-Tal & A. Nemirovski, 1998. "Robust Convex Optimization," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 769-805, November.
    18. Xin Chen & Melvyn Sim & Peng Sun, 2007. "A Robust Optimization Perspective on Stochastic Programming," Operations Research, INFORMS, vol. 55(6), pages 1058-1071, December.
    19. Joel Goh & Melvyn Sim, 2010. "Distributionally Robust Optimization and Its Tractable Approximations," Operations Research, INFORMS, vol. 58(4-part-1), pages 902-917, August.
    20. Xin Chen & Melvyn Sim & Peng Sun & Jiawei Zhang, 2008. "A Linear Decision-Based Approximation Approach to Stochastic Programming," Operations Research, INFORMS, vol. 56(2), pages 344-357, April.
    21. Arthur F. Veinott, Jr., 1965. "Optimal Policy for a Multi-Product, Dynamic, Nonstationary Inventory Problem," Management Science, INFORMS, vol. 12(3), pages 206-222, 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. Dimitris Bertsimas & Melvyn Sim & Meilin Zhang, 2019. "Adaptive Distributionally Robust Optimization," Management Science, INFORMS, vol. 65(2), pages 604-618, February.
    2. Joel Goh & Melvyn Sim, 2010. "Distributionally Robust Optimization and Its Tractable Approximations," Operations Research, INFORMS, vol. 58(4-part-1), pages 902-917, August.
    3. 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.
    4. Antonio J. Conejo & Nicholas G. Hall & Daniel Zhuoyu Long & Runhao Zhang, 2021. "Robust Capacity Planning for Project Management," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1533-1550, October.
    5. Shao-Wei Lam & Tsan Sheng Ng & Melvyn Sim & Jin-Hwa Song, 2013. "Multiple Objectives Satisficing Under Uncertainty," Operations Research, INFORMS, vol. 61(1), pages 214-227, February.
    6. Walid Ben-Ameur & Adam Ouorou & Guanglei Wang & Mateusz Żotkiewicz, 2018. "Multipolar robust optimization," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 395-434, December.
    7. Wang, Fan & Zhang, Chao & Zhang, Hui & Xu, Liang, 2021. "Short-term physician rescheduling model with feature-driven demand for mental disorders outpatients," Omega, Elsevier, vol. 105(C).
    8. Haolin Ruan & Zhi Chen & Chin Pang Ho, 2023. "Adjustable Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets," INFORMS Journal on Computing, INFORMS, vol. 35(5), pages 1002-1023, September.
    9. Gabrel, Virginie & Murat, Cécile & Thiele, Aurélie, 2014. "Recent advances in robust optimization: An overview," European Journal of Operational Research, Elsevier, vol. 235(3), pages 471-483.
    10. Jang Ho Kim & Woo Chang Kim & Frank J. Fabozzi, 2014. "Recent Developments in Robust Portfolios with a Worst-Case Approach," Journal of Optimization Theory and Applications, Springer, vol. 161(1), pages 103-121, April.
    11. Joel Goh & Nicholas G. Hall, 2013. "Total Cost Control in Project Management via Satisficing," Management Science, INFORMS, vol. 59(6), pages 1354-1372, June.
    12. Huan Xu & Constantine Caramanis & Shie Mannor, 2012. "Optimization Under Probabilistic Envelope Constraints," Operations Research, INFORMS, vol. 60(3), pages 682-699, June.
    13. Mengshi Lu & Zuo‐Jun Max Shen, 2021. "A Review of Robust Operations Management under Model Uncertainty," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1927-1943, June.
    14. Alireza Ghahtarani & Ahmed Saif & Alireza Ghasemi, 2021. "Robust Portfolio Selection Problems: A Comprehensive Review," Papers 2103.13806, arXiv.org, revised Jan 2022.
    15. Chuen-Teck See & Melvyn Sim, 2010. "Robust Approximation to Multiperiod Inventory Management," Operations Research, INFORMS, vol. 58(3), pages 583-594, June.
    16. Han, Biao & Shang, Chao & Huang, Dexian, 2021. "Multiple kernel learning-aided robust optimization: Learning algorithm, computational tractability, and usage in multi-stage decision-making," European Journal of Operational Research, Elsevier, vol. 292(3), pages 1004-1018.
    17. Hamed Mamani & Shima Nassiri & Michael R. Wagner, 2017. "Closed-Form Solutions for Robust Inventory Management," Management Science, INFORMS, vol. 63(5), pages 1625-1643, May.
    18. L. Jeff Hong & Zhiyuan Huang & Henry Lam, 2021. "Learning-Based Robust Optimization: Procedures and Statistical Guarantees," Management Science, INFORMS, vol. 67(6), pages 3447-3467, June.
    19. Fanwen Meng & Jin Qi & Meilin Zhang & James Ang & Singfat Chu & Melvyn Sim, 2015. "A Robust Optimization Model for Managing Elective Admission in a Public Hospital," Operations Research, INFORMS, vol. 63(6), pages 1452-1467, December.
    20. Aharon Ben-Tal & Dimitris Bertsimas & David B. Brown, 2010. "A Soft Robust Model for Optimization Under Ambiguity," Operations Research, INFORMS, vol. 58(4-part-2), pages 1220-1234, August.

    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:inm:oropre:v:59:y:2011:i:4:p:973-985. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.