Advertisement

Journal of the Operational Research Society

, Volume 66, Issue 4, pp 664–673 | Cite as

Solving mixed-integer robust optimization problems with interval uncertainty using Benders decomposition

  • Sauleh Siddiqui
  • Steven A Gabriel
  • Shapour Azarm
General Paper

Abstract

Uncertainty and integer variables often exist together in economics and engineering design problems. The goal of robust optimization problems is to find an optimal solution that has acceptable sensitivity with respect to uncertain factors. Including integer variables with or without uncertainty can lead to formulations that are computationally expensive to solve. Previous approaches for robust optimization problems under interval uncertainty involve nested optimization or are not applicable to mixed-integer problems where the objective or constraint functions are neither quadratic, nor linear. The overall objective in this paper is to present an efficient robust optimization method that does not contain nested optimization and is applicable to mixed-integer problems with quasiconvex constraints (⩽ type) and convex objective funtion. The proposed method is applied to a variety of numerical examples to test its applicability and numerical evidence is provided for convergence in general as well as some theoretical results for problems with linear constraints.

Keywords

robust optimization mixed-integer Benders decomposition interval uncertainty quasiconvex function 

Notes

Acknowledgements

The work presented in this paper was supported in part by the Office of Naval Research Contract N000140810384. The work of the third author was also supported in part by the ONR Grant N000141310160. Such support does not constitute an endorsement by the funding agency of the opinions expressed in this paper. We would also like to thank the anonymous referees for their comments.

References

  1. Atamturk A (2006). Strong formulations of robust mixed 0–1 programming. Mathematical Programming 108 (2–3): 235–250.CrossRefGoogle Scholar
  2. Balling R, Free J and Parkinson A (1986). Consideration of worst-case manufacturing tolerances in design optimization. Journal of Mechanisms, Transmissions, Automation in Design 108 (4): 438–441.CrossRefGoogle Scholar
  3. Beale E (1965). Survey of integer programming. Journal of the Operational Research Society 16 (2): 219–228.CrossRefGoogle Scholar
  4. Ben-Tal A and Nemirovski A (2002). Robust optimization—methodology and applications. Mathematical Programming, Series B 92 (3): 453–480.CrossRefGoogle Scholar
  5. Benders J (1962). Partitioning procedures for solving mixed-variables programming problems. Numerishe Mathematik 4 (1): 238–252.CrossRefGoogle Scholar
  6. Bertsimas D and Sim M (2004a). The price of robustness. Operations Research 52 (1): 35–33.CrossRefGoogle Scholar
  7. Bertsimas D and Sim M (2004b). Robust discrete optimization under ellipsoidal uncertainty sets, http://web.mit.edu/dbertsim/www/papers.html, accessed 3 April 2014.
  8. Conejo AJ, Castillo E, Minguez R and Garcia-Bertrand R (2006). Decomposition Techniques in Mathematical Programming. Springer: New York, NY.Google Scholar
  9. Floudas CA et al (1999). Handbook of Test Problems in Local and Global Optimization. Springer: New York, NY.CrossRefGoogle Scholar
  10. Gabriel S, Shim Y, Conejo A, de la Torre S and Garcia-Bertrand R (2009). A Benders decomposition method for discretely-constrained mathematical programs with equilibrium constraints. Journal of the Operational Research Society 61 (9): 1–16.Google Scholar
  11. GAMS (2009). General Algebraic Modeling System, GAMS Version 22.9, www.gams.com.
  12. Ganzerli S and Pantelides CP (1999). Load and resistance convex models for optimum design. Structural Optimization 17 (4): 259–268.CrossRefGoogle Scholar
  13. Hock W and Schittkowski K (1980). Test Examples for Nonlinear Programming Codes. Springer-Verlag: New York, NY.Google Scholar
  14. Li M, Azarm S and Boyars A (2006). A new deterministic approach using sensitivity region measures for multi-objective robust and feasibility robust design optimization. Journal of Mechanical Design 128 (4): 874–883.CrossRefGoogle Scholar
  15. Li M, Gabriel S, Shim Y and Azarm S (2011). Interval uncertainty-based robust optimization for convex and non-convex quadratic programs with applications in network infrastructure planning. Networks and Spatial Economics 11 (1): 159–191.CrossRefGoogle Scholar
  16. Magrab E, Azarm S, Balachandran B, Duncan J, Herold K and Walsh G (2004). An Engineer's Guide to Matlab. Prentice-Hall: New York, NY.Google Scholar
  17. Montemanni R (2006). A Benders decomposition approach for the robust spanning tree problem with interval data. Discrete Optimization 174 (3): 1479–1490.Google Scholar
  18. Ng TS, Sun. Y and Fowler J (2010). Semiconductor lot allocation using robust optimization. European Journal of Operational Research 205 (3): 557–570.CrossRefGoogle Scholar
  19. Poojari C, Lucas C and Mitra G (2008). Robust solutions and risk measures for a supply chain planning problem under uncertainty. Journal of the Operational Research Society 59 (1): 2–12.CrossRefGoogle Scholar
  20. Saito H and Murota K (2007). Benders decomposition approach to robust mixed integer programming. Pacific Journal of Optimization 3 (1): 99–112.Google Scholar
  21. Siddiqui S (2011). Solving two-level optimization problems with application to robust design and energy markets. Doctoral Dissertation, University of Maryland, College Park, MD.Google Scholar
  22. Siddiqui S, Azarm S and Gabriel S (2011). A modified Benders decomposition method for efficient robust optimization under interval uncertainty. Structural and Multidisciplinary Optimization 44 (2): 259–275.CrossRefGoogle Scholar
  23. Soyster AL (1973). Convex programming with set-inclusive constraints and applications to inexact linear programming. Operations Research 21 (5): 1154–1157.CrossRefGoogle Scholar
  24. Wu Y (2011). Modeling of containerized air cargo forwarding problems under uncertainty. Journal of the Operational Research Society 62 (7): 1211–1226.CrossRefGoogle Scholar
  25. Zeghal F, Haouari M, Sherali H and Aissaoui N (2011). Flexible aircraft fleeting and routing at TunisAir. Journal of the Operational Research Society 62 (2): 368–380.CrossRefGoogle Scholar
  26. Zhu X and Sherali H (2009). Two-stage workforce planning under demand fluctuations and uncertainty. Journal of the Operational Research Society 60 (1): 94–103.CrossRefGoogle Scholar

Copyright information

© Operational Research Society Ltd. 2014

Authors and Affiliations

  • Sauleh Siddiqui
    • 1
  • Steven A Gabriel
    • 2
  • Shapour Azarm
    • 3
  1. 1.Johns Hopkins UniversityBaltimoreUSA
  2. 2.Department of Civil EngineeringApplied Mathematics & Statistics, and Scientific Computation Program, University of MarylandCollege ParkUSA
  3. 3.Department of Mechanical EngineeringApplied Mathematics & Statistics, and Scientific Computation Program, University of MarylandCollege ParkUSA

Personalised recommendations