Radius of Robust Feasibility for Mixed-Integer Problems

Published Online:https://doi.org/10.1287/ijoc.2020.1030

References

  • Aßmann D, Liers F, Stingl M (2019) Decomposable robust two-stage optimization: An application to gas network operations under uncertainty. Networks 74(1):40–61.Google Scholar
  • Avriel M, Diewert W, Schaible S, Zang I (2010) Generalized Concavity (SIAM, Philadelphia).Google Scholar
  • Ben-Tal A, Nemirovski A (2008) Selected topics in robust convex optimization. Math. Programming 112(1):125–158.Google Scholar
  • Ben-Tal A, den Hertog D, Vial JP (2015) Deriving robust counterparts of nonlinear uncertain inequalities. Math. Programming 149(1-2):265–299.Google Scholar
  • Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust Optimization (Princeton University Press, Princeton, NJ).Google Scholar
  • Bertsimas D, Brown DB (2009) Constructing uncertainty sets for robust linear optimization. Oper. Res. 57(6):1483–1495.Google Scholar
  • Bertsimas D, Brown DB, Caramanis C (2011) Theory and applications of robust optimization. SIAM Rev. 53(3):464–501.Google Scholar
  • Bertsimas D, Gupta V, Kallus N (2018) Data-driven robust optimization. Math. Programming 167(2):235–292.Google Scholar
  • Boyd S, Vandenberghe L (2004) Convex Optimization (Cambridge University Press, UK).Google Scholar
  • Buchheim C, Kurtz J (2018) Robust combinatorial optimization under convex and discrete cost uncertainty. EURO J. Comput. Optim. 6(3):211–238.Google Scholar
  • Cánovas MJ, López MA, Parra J, Todorov MI (1999) Stability and well-posedness in linear semi-infinite programming. SIAM J. Optim. 10(1):82–98.Google Scholar
  • Cánovas MJ, López MA, Parra J, Toledo FJ (2005) Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems. Math. Programming 103(1):95–126.Google Scholar
  • Cánovas MJ, López MA, Parra J, Toledo FJ (2011) Distance to ill-posedness for linear inequality systems under block perturbations: convex and infinite-dimensional cases. Optimization 60(7):925–946.Google Scholar
  • Carrizosa E, Nickel S (2003) Robust facility location. Math. Methods Oper. Res. 58(2):331–349.Google Scholar
  • Carrizosa E, Ushakov A, Vasilyev I (2015) Threshold robustness in discrete facility location problems: a bi-objective approach. Optim. Lett. 9(7):1297–1314.Google Scholar
  • Chan TC, Mar PA (2017) Stability and continuity in robust optimization. SIAM J. Optim. 27(2):817–841.Google Scholar
  • Charnes A, Cooper WW (1962) Programming with linear fractional functionals. Naval Res. Logistics Quart. 9:181–186.Google Scholar
  • Chen J, Li J, Li X, Lv Y, Yao JC (2020) Radius of robust feasibility of system of convex inequalities with uncertain data. J. Optim. Theory Appl. 184(2):384–399.Google Scholar
  • Chuong TD, Jeyakumar V (2017) An exact formula for radius of robust feasibility of uncertain linear programs. J. Optim. Theory Appl. 173(1):203–226.Google Scholar
  • Crespi GP, Kuroiwa D, Rocca M (2018) Robust optimization: Sensitivity to uncertainty in scalar and vector cases, with applications. Oper. Res. Perspectives 5:113–119.Google Scholar
  • Dolan ED, Moré JJ (2002) Benchmarking optimization software with performance profiles. Math. Programming 91(2):201–213.Google Scholar
  • Goberna MA, Jeyakumar V, Li G, Linh N (2016) Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints. Oper. Res. Lett. 44(1):67–73.Google Scholar
  • Goberna MA, Jeyakumar V, Li G, Vicente-Pérez J (2014) Robust solutions of multiobjective linear semi-infinite programs under constraint data uncertainty. SIAM J. Optim. 24(3):1402–1419.Google Scholar
  • Goberna MA, Jeyakumar V, Li G, Vicente-Pérez J (2015) Robust solutions to multi-objective linear programs with uncertain data. Eur. J. Oper. Res. 242(3):730–743.Google Scholar
  • Gorissen BL, Yanıkoğlu I, den Hertog D (2015) A practical guide to robust optimization. Omega 53:124–137.Google Scholar
  • Gurobi Optimization LLC (2018) Gurobi optimizer reference manual. Accessed December 16, 2020, http://www.gurobi.com.Google Scholar
  • Hiriart-Urruty JB, Lemaréchal C (1993) Convex Analysis and Minimization Algorithms, Grundlehren der Mathematischen Wissenschaften, vol. 305 (Springer-Verlag, Berlin).Google Scholar
  • Koch T, Hiller B, Pfetsch M, Schewe L, eds. (2015) Evaluating Gas Network Capacities (Society for Industrial and Applied Mathematics, Philadelphia).Google Scholar
  • Li XB, Wang QL (2018) A note on the radius of robust feasibility for uncertain convex programs. Filomat 32:6809–6818.Google Scholar
  • MIPLIB 2017 (2018) MIPLIB 2017. Accessed December 16, 2020, http://miplib.zib.de.Google Scholar
  • Schaible S (1976) Fractional programming. I. Duality. Management Sci. 22(8):858–867.Google Scholar
  • Schewe L, Schmidt M, Thürauf J (2020) Structural properties of feasible bookings in the european entry-exit gas market system. 4OR 18(2):197–218.Google Scholar
  • Zhang Q, Grossmann IE, Lima RM (2016) On the relation between flexibility analysis and robust optimization for linear systems. AIChE J. 62(9):3109–3123.Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.