Skip to main content
SpringerLink
Log in

A Robust Discrete Optimization Framework

  • Chapter
Robust Discrete Optimization and Its Applications

Part of the book series: Nonconvex Optimization and Its Applications ((NOIA,volume 14))

Abstract

The main objective of this chapter is to discuss the formulation of an optimization problem the solution of which leads to the identification of robust decisions. In Chapter 1 we formally defined the Robustness Approach to Decision Making. According to our discussion, three different robustness criteria can be used for the selection of the robust decision.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.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.

References

  1. Brandeau, M.L. and S.S. Chiu (1989), “An Overview of Representative Problems in Location Research,” Management Science, 35, 6, 645–674.

    Article  MathSciNet  MATH  Google Scholar 

  2. Chen, B. and C.S. Lin (1995), “Robust One Median Location Problem”. Working Paper, Department of Management and Systems, Washington State University, Pullman, Washington.

    Google Scholar 

  3. Chvatal, V. (1983), Linear Programming. W.H. Freeman and Company, New York.

    MATH  Google Scholar 

  4. Daniels, R.L. and P. Kouvelis (1995), “Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production,” Management Science, 41, 2, 363–376.

    Article  MATH  Google Scholar 

  5. Dijkstra, E.W. (1959), “A Note on Two Problems in Connection with Graphs,” Numerische Mathematik, l, 269–271.

    Article  MathSciNet  Google Scholar 

  6. Efroymson, M.A. and T.L. Ray (1966), “A Branch and Bound Algorithm for Plant Location,” Operations Research, 14, 361–368.

    Article  Google Scholar 

  7. Erlenkotter, D. (1978), “A Dual-Based Procedure for Uncapacitated Facility Location,” Operations Research, 26, 992–1009.

    Article  MathSciNet  MATH  Google Scholar 

  8. Federgruen, A. and M. Tzur (1991), “A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time,” Management Science, 37, 909–925.

    Article  MATH  Google Scholar 

  9. Florian, M. and M. Klein (1970), “Deterministic Production Planning with Concave Costs and Capacity Constraints,” Management Science, 18, 1, 12–20.

    Article  MathSciNet  Google Scholar 

  10. Francis, R.L., L.F. McGinnis and J.A. White (1992), Facility Layout and Location: An Analytical Approach, Prentice Hall, Englewood Cliffs, New Jersey.

    Google Scholar 

  11. Gallego, G. and I. Moon (1993), “The Distribution Free Newsboy Problem: Review and Extensions,” Journal of Operational Research Society, 44, 8, 825–834.

    MATH  Google Scholar 

  12. Gavish, B. (1982), “Topological Design of Centralized Computer Networks — Formulations and Algorithms,” Networks, 12, 355–377.

    Article  MathSciNet  MATH  Google Scholar 

  13. Gutierrez, G.J., P. Kouvelis and A.A. Kurawarwala (1996), “A Robustness Approach to Uncapacitated Network Design Problems,” European Journal of Operational Research, forthcoming.

    Google Scholar 

  14. Harris, R.S. (1913), “How Many Parts to Make at Once,” Factory, The Magazine of Management, 10, 2, 135–136.

    Google Scholar 

  15. Hillier, F.S. and G.J. Lieberman (1990), Introduction to Mathematical Programming, McGraw Hill, New York.

    Google Scholar 

  16. Ibaraki, T. and N. Katoh (1988), Resource Allocation Problems: Algorithmic Approaches, the MIT Press, Cambridge, Massachusetts.

    MATH  Google Scholar 

  17. Johnson, S.M. (1954), “Optimal Two- and Three-Stage Production Schedules with Setup Times Included,” Naval Research Logistics Quarterly, 1, 61–68.

    Article  Google Scholar 

  18. Karabati, S., P. Kouvelis and G. Yu (1996), “A Min-Max-Sum Resource Allocation Problem and Its Applications,” Working Paper, Fuqua School of Business, Duke University.

    Google Scholar 

  19. Khumawala, B.M. (1972), “A Branch and Bound Algorithm for Plant Location,” Management Science, 18, 718–731.

    Article  Google Scholar 

  20. Kouvelis, P., A.A. Kurawarwala and G.J. Gutiérrez (1992), “Algorithms for Robust Single and Multiple Period Layout Planning for Manufacturing Systems,” European Journal of Operational Research, 63, 287–303.

    Article  MATH  Google Scholar 

  21. Kouvelis, P., R.L. Daniels and G. Vairaktarakis (1996), “Robust Scheduling of a Two-Machine Flow Shop with Uncertain Processing Times,” Working Paper, Fuqua School of Business, Duke University (to appear in Naval Research Logistics).

    Google Scholar 

  22. Kouvelis, P., G. Vairaktarakis and G. Yu (1996), “Robust 1-Median Location on a Tree in the Presence of Demand and Transportation Cost Uncertainty,” Working Paper, Fuqua School of Business, Duke University.

    Google Scholar 

  23. Kouvelis, P. and G. Yu (1995), “Robust Discrete Optimization and Its Applications,” Working Paper, Department of MSIS, Graduate School of Business, The University of Texas at Austin.

    Google Scholar 

  24. Kruskal, J.B. (1956), “On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem,” in Proceedings of the American Mathematical Society, 7, 48–50.

    Google Scholar 

  25. Larson, R.C. and A.R. Odoni (1981), Urban Operations Research, Prentice Hall, Englewood Cliffs, New Jersey.

    Google Scholar 

  26. Lee, H.L. and S. Nahmias (1993), “Single-Product, Single Location Models,” Handbooks in Operations Research and Management Science, Vol. 4, edited by S.C. Graves, A.H.G. Rinnooy Kan and P.H. Zipkin, Elsevier Science Publishers B.V., 3–55.

    Google Scholar 

  27. Magnanti, T.L. and Wong, R.T. (1984), “Network Design and Transportation Planning: Models and Algorithms,” Transportation Science, 18, 1, 1–55.

    Article  Google Scholar 

  28. Moon, I. and G. Gallego (1994), “Distribution Free Procedures for Some Inventory Models,” Journal of the Operational Research Society, 45, 6, 651–658.

    MATH  Google Scholar 

  29. Murty, K.G. (1983), Linear Programming, Wiley, New York.

    MATH  Google Scholar 

  30. Prim, R.C. (1957), “Shortest Connection Networks and Some Generalizations,” Bell System Technical Journal, 36, 1389–1401.

    Google Scholar 

  31. Rosenhead, M.J., M. Elton and S.K. Gupta (1972), “Robustness and Optimally as Criteria for Strategic Decisions,” Operational Research Quarterly, 23, 4, 413–430.

    Article  Google Scholar 

  32. Scarf, H. (1958), “A Min-Max Solution of an Inventory Problem,” in Studies in the Mathematical Theory of Inventory and Production,” K. Arrow, S. Karlin and H. Scarf (Eds.), Stanford University Press, 201–209.

    Google Scholar 

  33. Silver, E.A. and R. Peterson (1985), Decision Systems for Inventory Management and Production Planning,” Wiley, New York.

    Google Scholar 

  34. Tansel, B.C., R.L. Francis and T.J. Lowe (1983), “Location on Networks: A Survey — Part II, Exploiting Tree Network Structure,” Management Science, 29, 498–511.

    Article  MathSciNet  MATH  Google Scholar 

  35. Toth, P. (1980), “Dynamic Programming Algorithms for the Zero-one Knapsack Problem,” Computing, 25, 29–45.

    Article  MathSciNet  MATH  Google Scholar 

  36. Vairaktarakis, G.(1995), “Robust Solutions for Multi-Item Newsboy Models with a Budget Constraint and Uncertain Demand,” Working Paper, College of Business Administration, Marquette University, Milwaukee.

    Google Scholar 

  37. Vairaktarakis, G. and P. Kouvelis (1996), “Incorporating Dynamic Aspects and Uncertainty in 1-Median Location Problems,” Working Paper, College of Business Administration, Marquette University, Milwaukee.

    Google Scholar 

  38. Van Roy, T.J. and D. Erlenkotter (1982), “A Dual-Based Procedure for Dynamic Facility Location,” Management Science, 28, 10, 1091–1105.

    Article  MATH  Google Scholar 

  39. Wagelmans, A., S. Van Hoesel and A. Kolen (1992), “Economic Lot Sizing: an O(n logn) Algorithm that runs in Linear Time in the Wagner-Whitin Case,” Operations Research, 40, 5145–5156.

    Article  Google Scholar 

  40. Wagner, H.M. and T.M. Whitin (1958), “Dynamic Version of the Economic Lot Size Model,” Management Science, 5, 89–96.

    Article  MathSciNet  MATH  Google Scholar 

  41. Wilson, R.H. (1934), “A Scientific Routine for Stock Control,” Harvard Business Review 13, 116–128.

    Google Scholar 

  42. Yu, G. (1994), “Robust Shortest Path Problem in Layered Networks,” Working Paper, Department of MSIS, University of Texas at Austin.

    Google Scholar 

  43. Yu, G. (1996a), “Robust Economic Order Quantity Models,” European Journal of Operational Research, forthcoming.

    Google Scholar 

  44. Yu, G. (1996b), “On the Max-min 0–1 Knapsack Problem with Robust Optimization Applications,” Operations Research, 44, 2, 407–415.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Olin School of Business, Washington University at St. Louis, St. Louis, Missouri, USA

    Panos Kouvelis

  2. Center for Cybernetic Studies, The University of Texas, Austin, Texas, USA

    Gang Yu

Authors
  1. Panos Kouvelis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gang Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Kouvelis, P., Yu, G. (1997). A Robust Discrete Optimization Framework. In: Robust Discrete Optimization and Its Applications. Nonconvex Optimization and Its Applications, vol 14. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2620-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-2620-6_2

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-4764-2

  • Online ISBN: 978-1-4757-2620-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation