Skip to main content

A Relative Robust Optimization Approach for Full Factorial Scenario Design of Data Uncertainty and Ambiguity

  • Chapter
  • First Online:
Optimization and Logistics Challenges in the Enterprise

Part of the book series: Springer Optimization and Its Applications ((SOIA,volume 30))

  • 1996 Accesses

Summary

This chapter presents a relative robust optimization algorithm for two-stage decision making under uncertainty (ambiguity) where the structure of the first-stage problem is a mixed integer linear programming model and the structure of the second-stage problem is a linear programming model. In the structure of the considered problem, each uncertain parameter can take its value from a finite set of real numbers with unknown probability distribution independently of other parameters’ settings. This structure of parametric uncertainty is referred to in this chapter as the full-factorial scenario design of data uncertainty. The algorithm is shown to be efficient for solving large-scale relative robust optimization problems under this structure of the parametric uncertainty. The algorithm coordinates three computational stages to efficiently solve the overall optimization problem. Bi-level programming formulations are the main components in two of these three computational stages. The main contributions of this chapter are the theoretical development of the robust optimization algorithm and its applications in robust strategic decision making under uncertainty (e.g., supply chain network infrastructure design problems).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Refereneces

  1. Assavapokee, T., Realff, M., Ammons, J., and Hong, I. (2008), Scenario Relaxation Algorithm for Finite Scenario Based Min-Max Regret and Min-Max Relative Regret Robust Optimization, Computers and Operations Research, Vol. 35, No.6.

    Google Scholar 

  2. Assavapokee, T., Realff, M., and Ammons, J. (2008), A Min-Max Regret Robust Optimization Approach for Interval Data Uncertainty, Journal of Optimization Theory and Applications, Vol. 136, No. 3.

    Google Scholar 

  3. Averbakh, I. (2001), On the Complexity of a Class of Combinatorial Optimization Problems with Uncertainty, Mathematical Programming, 90, 263-272.

    Google Scholar 

  4. Averbakh, I. (2000), Minmax Regret Solutions for Minimax Optimization Problems with Uncertainty, Operations Research Letters, 27/2, 57-65.

    Google Scholar 

  5. Bai, D., Carpenter, T., Mulvey, J. (1997), Making a Case for Robust Optimization Models, Management Science, 43/7, 895-907.

    Article  Google Scholar 

  6. Bajalinov, E.B. (2003), Linear Fractional Programming: Theory, Methods, Applications and Software, Applied Optimization, Kluwer Academic Publishers.

    Google Scholar 

  7. Bard, J.F. and Falk, J.E. (1982), An Explicit Solution to the Multi-level Programming Problem, Computers and Operations Research, Vol. 9/1, 77-100.

    Article  MathSciNet  Google Scholar 

  8. Bard, J.F. and Moore, J.T. (1990), A Branch and Bound Algorithm for the Bilevel Programming Problem, SIAM Journal of Scientific and Statistical Computing, Vol. 11/2, 281-292.

    MathSciNet  Google Scholar 

  9. Bard, J.F. (1991), Some Properties of Bilevel Programming Problem, Journal of Optimization Theory and Application, Vol. 68/2, 371-378.

    Google Scholar 

  10. Bard, J.F. (1998), Practical Bilevel Optimization: Algorithms and Applications, Nonconvex Optimization and Its Applications, 30, Kluwer Academic Publishers.

    Google Scholar 

  11. Benders, J.F. (1962), Partitioning Procedures for Solving Mixed Variables Programming Problems, Numerische Mathematik, 4, 238-252.

    Google Scholar 

  12. Ben-Tal, A. and Nemirovski, A. (1998), Robust Convex Optimization, Mathematical Methods of Operations Research, 23, 769-805.

    MATH  MathSciNet  Google Scholar 

  13. Ben-Tal, A. and Nemirovski, A. (1999), Robust Solutions to Uncertain Programs, Operations Research Letters, 25, 1-13.

    Article  MATH  MathSciNet  Google Scholar 

  14. Ben-Tal, A. and Nemirovski, A. (2000), Robust Solutions of Linear Programming Problems Contaminated with Uncertain Data, Mathematical Programming, 88, 411-424.

    Article  MATH  MathSciNet  Google Scholar 

  15. Ben-Tal, A., El-Ghaoui, L. and Nemirovski, A. (2000), Robust Semidefinite Programming, In: Saigal, R., Vandenberghe, L., Wolkowicz, H., (eds.), Semidefinite Programming and Applications, Kluwer Academic Publishers.

    Google Scholar 

  16. Bertsimas, D. and Sim, M. (2003), Robust Discrete Optimization and Network Flows, Mathematical Programming Series B, 98, 49-71.

    Article  MATH  MathSciNet  Google Scholar 

  17. Bertsimas, D. and Sim, M. (2004), The Price of Robustness, Operations Research, 52/1, 35-53.

    Article  MathSciNet  Google Scholar 

  18. Chopra, S. and Meindl, P. (2003), Supply Chain Management: Strategy, Planning, and Operations (2nd edition), Prentice Hall Publishers.

    Google Scholar 

  19. Hansen, P., Jaumard, B., and Savard, G. (1992), New Branch-and-Bound Rules for Linear Bilevel Programming, SIAM Journal of Scientific and Statistical Computing, Vol. 13/5, 1194-1217.

    MathSciNet  Google Scholar 

  20. Huang, H.-X. and Pardalos, P.M. (2002), A Multivariate Partition Approach to Optimization Problems, Cybernetics and Systems Analysis, 38, 2, 265-275.

    Article  MATH  MathSciNet  Google Scholar 

  21. Kouvelis, P. and Yu, G. (1997), Robust Discrete Optimization and Its Applications, Kluwer Academic Publishers, Dordecht, The Netherlands.

    MATH  Google Scholar 

  22. Mausser, H.E. and Laguna, M. (1998), A New Mixed Integer Formulation for the Maximum Regret Problem, International Transactions in Operational Research, 5/5, 389-403.

    Article  Google Scholar 

  23. Mausser, H.E. and Laguna, M. (1999), Minimizing the Maximum Relative Regret for Linear Programmes with Interval Objective Function Coefficients, Journal of the Operational Research Society, 50/10, 1063-1070.

    Article  Google Scholar 

  24. Mausser, H.E. and Laguna, M. (1999), A Heuristic to Minimax Absolute Regret for Linear Programs with Interval Objective Function Coefficients, Europian Journal of Operational Research, 117, 157-174.

    Article  MATH  Google Scholar 

  25. Migdalas, A., Pardalos, P.M., and Varbrand, P. (Editors) (1997), Multilevel Optimization: Algorithms and Applications, Kluwer Academic Publishers.

    Google Scholar 

  26. Mulvey, J., R. Vanderbei, S. Zenios (1995), Robust Optimization of Large-Scale Systems, Operations Research, 43, 264-281.

    Article  MATH  MathSciNet  Google Scholar 

  27. Terlaky, T. (1996), Interior Point Methods in Mathematical Programming, Kluwer Academic Publisher.

    Google Scholar 

  28. Von Stackelberg, H. (1943), Grundzuge der Theoretischen Volkswirtschaftslehre Stuttgart, Berlin: W. Kohlhammer.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tiravat Assavapokee .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag US

About this chapter

Cite this chapter

Assavapokee, T., Realff, M.J., Ammons, J.C. (2009). A Relative Robust Optimization Approach for Full Factorial Scenario Design of Data Uncertainty and Ambiguity. In: Chaovalitwongse, W., Furman, K., Pardalos, P. (eds) Optimization and Logistics Challenges in the Enterprise. Springer Optimization and Its Applications, vol 30. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-88617-6_4

Download citation

Publish with us

Policies and ethics