Computational Complexity Results of Robust Discrete Optimization Problems

  • Panos Kouvelis
  • Gang Yu
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 14)

Abstract

In previous chapters, we have mentioned that the robust discrete optimization problems are in general more difficult to solve than their deterministic counterparts. The major source of complexity comes from the extra degree of freedom — the scenario set. For many polynomially solvable classical optimization problems such as assignment, minimum spanning tree, shortest path, resource allocation, production control, single machine scheduling with sum of flow times criterion, and two machine flow shop scheduling, their corresponding robust versions are weakly or strongly NP-hard. We have found (see Yu and Kouvelis (1995)) that some of the above mentioned problems can be solved by pseudo-polynomial procedures based on dynamic programming if the scenario set is restricted to be bounded (constituting bounded number of scenarios). The well known pseudo-polynomially solvable knapsack problem also remains pseudo-polynormally solvable for bounded scenario set, but becomes strongly NP-hard for unbounded scenario set.

Keywords

Minimum Span Tree Knapsack Problem Complexity Result Resource Allocation Problem Grid Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Baker, K.R. (1974), Introduction to Sequencing and Scheduling, Wiley, New York.Google Scholar
  2. [2]
    Balinski, M.L. (1985), “Signature Methods for the Assignment Problem,” Operations Research, 33, 527–536.MathSciNetMATHCrossRefGoogle Scholar
  3. [3]
    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.MATHCrossRefGoogle Scholar
  4. [4]
    Dijkstra, E.W. (1959), “A Note on Two Problems in Connection with Graphs,” Numerische Mathematik, 1, 269–271.MathSciNetMATHCrossRefGoogle Scholar
  5. [5]
    Federgruen, A. and M. Tzur (1991), “A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in O(n log n) or O(n) Time,” Management Science, 37, 909–925.MATHCrossRefGoogle Scholar
  6. [6]
    Florian, M. and M. Klein (1970), “Deterministic Production Planning with Concave Costs and Capacity Constraints,” Management Science, 18, 1, 12–20.MathSciNetCrossRefGoogle Scholar
  7. 7]
    [ Garey, M.R. and D.S. Johnson (1979), Computers and Intractability, W.H. Freeman, San Francisco.MATHGoogle Scholar
  8. [8]
    Hadley, G. and T. Whitin (1963), Analysis of Inventory Systems, Prentice Hall. Englewood Cliffs, New Jersey.MATHGoogle Scholar
  9. [9]
    Ibaraki, T. and N. Katoh (1988), Resource Allocation Problems: Algorithmic Approaches, the MIT Press, Cambridge, Massachusetts.MATHGoogle Scholar
  10. [10]
    Johnson, S.M. (1954), “Optimal Two- and Three-Stage Production Schedules with Setup Times Included,” Naval Research Logistics Quarterly, 1, 61–68.CrossRefGoogle Scholar
  11. [11]
    Karabati, S., P. Kouvelis and G. Yu (1995), “A Min-Max-Sum Resource Allocation Problem and Its Applications,” Working Paper, Fuqua School of Business, Duke University.Google Scholar
  12. [12]
    Karp, R.M. (1972), “Reducibility among Combinatorial Problems,” in R.E. Miller and J.W. Thatcher (eds.), Complexity of Computer Communications, Plenum Press, NY, 85–103.CrossRefGoogle Scholar
  13. [13]
    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
  14. [14]
    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
  15. [15]
    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.MathSciNetMATHCrossRefGoogle Scholar
  16. [16]
    Martello, S. and P. Toth(1990), Knapsack Problems: Algorithms and Computer Implementations, John Wiley & Sons, New York.MATHGoogle Scholar
  17. [17]
    Nemhauser, G.L. and L.A. Wolsey (1988), Integer and Combinatorial Optimization, Wiley, New York.MATHGoogle Scholar
  18. [18]
    Papadimitriou, C.H. and K. Steiglitz (1982), Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, Englewood Cliffs, New Jersey.MATHGoogle Scholar
  19. [19]
    Prim, R.C. (1957), “Shortest Connection Networks and Some Generalizations,” Bell System Technical Journal, 36, 1389–1401.Google Scholar
  20. [20]
    Silver, E.A. and R. Peterson (1985), Decision Systems for Inventory Management and Production Planning Wiley, New York.Google Scholar
  21. [21]
    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
  22. [22]
    Wagelmans, A., S. Van Hoesel and A. Kolen (1992), “Economic Lot Sizing: an 0(n log n) Algorithm that runs in Linear Time in the Wagner-Whitin Case,” Operations Research, 40, 5145–5156.CrossRefGoogle Scholar
  23. [23]
    Yu, G. (1994), “Robust Shortest Path Problem in Layered Networks,” Working Paper, Department of MSIS, University of Texas at Austin.Google Scholar
  24. [24]
    Yu, G. (1996), “On the Max-min 0–1 Knapsack Problem with Robust Optimization Applications,” Operations Research, 44, 2, 407–415.MathSciNetMATHCrossRefGoogle Scholar
  25. [25]
    Yu, G. and P. Kouvelis (1993), “Complexity Results for a Class of Min-Max Problems with Robust Optimization Applications,” in Complexity in Numerical Optimization, P.M. Pardalos (Ed.), World Scientific Publishing Co., 501–511.Google Scholar
  26. [26]
    Yu, G. and P. Kouvelis (1995), “Min-max Optimization of Discrete Optimization Problems,” Minimax and Its Applications, edited by D.Z. Du and P.M. Pardalos, Kluwer Academic Publishers, 157–171.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1997

Authors and Affiliations

  • Panos Kouvelis
    • 1
  • Gang Yu
    • 2
  1. 1.Olin School of BusinessWashington University at St. LouisSt. LouisUSA
  2. 2.Center for Cybernetic StudiesThe University of TexasAustinUSA

Personalised recommendations