On Min-Max Optimization of a Collection of Classical Discrete Optimization Problems

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


In this paper, we study discrete optimization problems with min-max objective functions. This type of optimization has long been the attention of researchers, and it has direct applications in the recent development of robust optimization. The following well-known classes of problems are discussed: 1) the minimum spanning tree problem, 2) the resource allocation problem with separable cost functions, and 3) the production control problem. Computational complexities of the corresponding min-max version of the above-mentioned problems are analyzed. Pseudo-polynomial algorithms for these problems under certain conditions are provided.


Span Tree Robust Optimization Resource Allocation Problem Discrete Optimization 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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    E. Agasi, R.I. Becker and Y. Perl, “A Shifting Algorithm for Constrained Min-max Partition on Trees,” Discrete Applied Mathematics 45 (1993)1–28.MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    R.K. Ahuja, “Minimax Linear Programming Problem,” Operations Research Letters 4 (1985) 131–134.MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    M.S. Bazaraa and J.J. Goode, “An Algorithm for Solving Linearly Constrained Minimax Problems,” European Journal of Operational Research 11 (1982) 158–166.MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    W. Czuchra, “A Graphical Method to Solve a Maximin AUocation Problem,” European Journal of Operational Research 26 (1986) 259–261.MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Z. Drezner and G.O. Wesolowsky, “A Maximin Location Problem with Maximum Distance Constraints,” IIE Transactions 12 (1980) 249–252.MathSciNetGoogle Scholar
  6. 6.
    R.S.K. Dutta and M. Vidyasagar, “New Algorithm for Constrained Minimax Optimization,” Mathematical Programming 13 (1977) 140–155.MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    H.A. Eislet, “Continuous Maximin Knapsack Problems with GLB Constraints,” Mathematical Programming 36 (1986) 114–121.MathSciNetCrossRefGoogle Scholar
  8. 8.
    M.R. Garey and D.S. Johnson, Computers and Intractability, (W.H. Freeman, San Francisco, 1979).zbMATHGoogle Scholar
  9. 9.
    T. Ibaraki and N. Katoh, Resource Allocation Problems: Algorithmic Approaches, (MIT Press, Cambridge, Massachusetts, 1988 ).zbMATHGoogle Scholar
  10. 10.
    T. Ichimori, “On Min-max Integer AUocation Problems,” Operations Research 32 (1984) 449–450MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    S. Jacobsen, “On Margined AUocation in Single Constraint Min-max Problems,” Management Science 17 (1971) 780–783.MathSciNetzbMATHCrossRefGoogle Scholar
  12. 12.
    S. Kaplan, “Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation,” Operations Research 22 (1974) 802–807.zbMATHCrossRefGoogle Scholar
  13. 13.
    R.M. Karp, “Reducibility among Combinatorial Problems,” in R.E. MiUer and J.W. Thatcher, ed., Complexity of Computer Communications, ( Plenum Press, NY, 1972 ) pp. 85–103.Google Scholar
  14. 14.
    R.S. Klein, H. Luss and U.G. Rothblum, “Minimax Resource Allocation Problems with Resource-Substitutions Represented by Graphs,” Operations Research 41 5 (1993) 959–971.MathSciNetzbMATHCrossRefGoogle Scholar
  15. 15.
    J.B. Kruskal, “On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem,” in Proceedings of the American Mathematical Society 7 (1956) pp. 48–50.MathSciNetCrossRefGoogle Scholar
  16. 16.
    C. Lemarechal, “Nondifferentiable Optimization,” in: G.L. Nemhauser, A.H.G. Rinnooy Kan and M.J. Todd, eds., Handbooks in Operations Research and Management Science, Vol. 1 (Elsevier Science Publishers B.V., 1989 ) pp. 529–572.Google Scholar
  17. 17.
    H. Luss, “An Algorithm for Separable Nonlinear Minimax Problems,” Operations Research Letters 6, (1987) 159–162.MathSciNetzbMATHCrossRefGoogle Scholar
  18. 18.
    H. Luss and D.R. Smith, “Resource Allocation among Competing Activities: A Lexicographic Minimax Approach,” Operations Research Letters 5 (1986) 227–231.MathSciNetzbMATHCrossRefGoogle Scholar
  19. 19.
    K. Madsen and H. Schjaer-Jacobsen, “Linearly Constrained Minimax Optimization,” Mathematical Programming 14 (1978) 208–223.MathSciNetzbMATHCrossRefGoogle Scholar
  20. 20.
    J.S. Pang and C.S. Yu, “A Min-max Resource Allocation Problem with Substitutions,” European Journal of Operational Research 41 (1989) 218–223.MathSciNetzbMATHCrossRefGoogle Scholar
  21. 21.
    M.E. Posner and C.T. Wu, “Linear Max-min Programming,” Mathematical Programming 20 (1981) 166–172.MathSciNetzbMATHCrossRefGoogle Scholar
  22. 22.
    E.L. Porteus and J.S. Yormark, “More on the Min-max Allocation,” Management Science 18 (1972) 520–527.MathSciNetGoogle Scholar
  23. 23.
    R.C. Prim, “Shortest Connection Networks and Some Generalizations,” Bell System Technical Journal 36 (1957) 1389–1401.Google Scholar
  24. 24.
    C.P. Rangan and R. Govindan, “An O(n log n) Algorithm for a Maxmin Location Problem,” Discrete Applied Mathematics 36 (1992) 203–205.MathSciNetzbMATHCrossRefGoogle Scholar
  25. 25.
    J. Rosenhead, M. Elton, and S.K. Gupta, “Robustness and Optimality as Criteria for Strategic Decisions,” Operational Research Quarterly 23, 4 (1972) 413–430.CrossRefGoogle Scholar
  26. 26.
    C.S. Tang, “A Max-min Allocation Problem: Its Solutions and Applications,” Operations Research 36 (1988) 359–367.MathSciNetzbMATHCrossRefGoogle Scholar
  27. 27.
    H.M. Wagner and T. Whitin, “Dynamic Problems in the Theory of the Firm,” in T. Whitin, ed., Theory of Inventory Management, 2nd edition (Princeton University Press, Princeton, N.J., 1957 ).Google Scholar
  28. 28.
    T.L. Vincent, B.S. Goh and K.L. Teo, “Trajectory-Following Algorithms for Min-max Optimization Problems,” Journal of Optimization Theory and Applications 75, 3 (1992) 501–519.MathSciNetzbMATHCrossRefGoogle Scholar
  29. 29.
    G. Yu, “On the Max-min Knapsack Problem with Robust Optimization Applications,” Operations Research, forthcoming.Google Scholar
  30. 30.
    G. Yu and P. Kouvelis, “Robust Optimization Problems are Hard Problems to Solve,” Working paper, 92/93-3-6, Department of Management Science and Information Systems, Graduate School of Business, University of Texas at Austin (Austin, 1993 ).Google Scholar
  31. 31.
    G. Yu and P. Kouvelis, “Complexity Results for a Class of Min-Max Problems with Robust Optimization Applications,” in: P.M. Pardalos, ed., Complexity in Numerical Optimization (World Scientific Publishing Co., 1993 ) pp. 503–511.Google Scholar

Copyright information

© Kluwer Academic Publishers 1995

Authors and Affiliations

  • Gang Yu
    • 1
  • Panagiotis Kouvelis
    • 2
  1. 1.Department of Management Science and Information SystemsThe University of Texas at AustinAustinUSA
  2. 2.The Fuqua School of BusinessDuke UniversityDurhamUSA

Personalised recommendations