Robust optimization made easy with ROME 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 url{}.

References in zbMATH (referenced in 46 articles )

Showing results 1 to 20 of 46.
Sorted by year (citations)

1 2 3 next

  1. Hughes, Martin; Goerigk, Marc; Wright, Michael: A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty (2019)
  2. Bertsimas, Dimitris; Georghiou, Angelos: Binary decision rules for multistage adaptive mixed-integer optimization (2018)
  3. Chassein, André; Goerigk, Marc: Compromise solutions for robust combinatorial optimization with variable-sized uncertainty (2018)
  4. Chen, Ruidi; Paschalidis, Ioannis Ch.: A robust learning approach for regression models based on distributionally robust optimization (2018)
  5. Gauvin, Charles; Delage, Erick; Gendreau, Michel: A stochastic program with time series and affine decision rules for the reservoir management problem (2018)
  6. Karimi, Mehdi; Moazeni, Somayeh; Tunçel, Levent: A utility theory based interactive approach to robustness in linear optimization (2018)
  7. Wang, Guanglei; Hijazi, Hassan: Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches (2018)
  8. Xu, Huifu; Liu, Yongchao; Sun, Hailin: Distributionally robust optimization with matrix moment constraints: Lagrange duality and cutting plane methods (2018)
  9. Yanikoğlu, İhsan; Kuhn, Daniel: Decision rule bounds for two-stage stochastic bilevel programs (2018)
  10. de Ruiter, Frans J. C. T.; Ben-Tal, Aharon; Brekelmans, Ruud C. M.; den Hertog, Dick: Robust optimization of uncertain multistage inventory systems with inexact data in decision rules (2017)
  11. Dunning, Iain; Huchette, Joey; Lubin, Miles: JuMP: a modeling language for mathematical optimization (2017)
  12. Gauvin, Charles; Delage, Erick; Gendreau, Michel: Decision rule approximations for the risk averse reservoir management problem (2017)
  13. Govindan, Kannan; Fattahi, Mohammad; Keyvanshokooh, Esmaeil: Supply chain network design under uncertainty: a comprehensive review and future research directions (2017)
  14. Pflug, Georg Ch.; Timonina-Farkas, Anna; Hochrainer-Stigler, Stefan: Incorporating model uncertainty into optimal insurance contract design (2017)
  15. Sengupta, Raghu Nandan; Kumar, Rakesh: Robust and reliable portfolio optimization formulation of a chance constrained problem (2017)
  16. Zola, Enrica; Kassler, Andreas J.: Optimising for energy or robustness? Trade-offs for VM consolidation in virtualized datacenters under uncertainty (2017)
  17. Ayoub, Josette; Poss, Michael: Decomposition for adjustable robust linear optimization subject to uncertainty polytope (2016)
  18. Cheng, Jianqiang; Leung, Janny; Lisser, Abdel: New reformulations of distributionally robust shortest path problem (2016)
  19. Gourtani, Arash; Xu, Huifu; Pozo, David; Nguyen, Tri-Dung: Robust unit commitment with $n-1$ security criteria (2016)
  20. Lam, Henry: Robust sensitivity analysis for stochastic systems (2016)

1 2 3 next