Min-max optimization of several classical discrete optimization problems

Journal of Optimization Theory and Applications

Volumn 98, Issue 1, 1998, Pages 221-242

  Yu, G ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Computational complexity; Min max discrete optimization; Pseudopolynomial algorithms

Indexed keywords

COST FUNCTIONS; OPTIMIZATION; PRODUCTION CONTROL;

DISCRETE OPTIMIZATION; DISCRETE OPTIMIZATION PROBLEMS; MIN-MAX; MIN-MAX DISCRETE OPTIMIZATION; MIN-MAX OPTIMIZATION; MINIMUM SPANNING TREE PROBLEM; OBJECTIVE FUNCTIONS; PSEUDOPOLYNOMIAL ALGORITHMS; RESOURCE ALLOCATION PROBLEM; ROBUST OPTIMIZATION;

COMPUTATIONAL COMPLEXITY;

EID: 0032373929     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022601301102     Document Type: Article

References (31)

1. Yu, G., and KOUVELIS, P., 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, Texas, 1993.
2. IBARAKI, T., and KATOH, N., Resource Allocation Problems: Algorithmic Approaches, MIT Press, Cambridge, Massachusetts, 1988.
3. KAPLAN, S., Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation, Operations Research, Vol. 22, pp. 802-807, 1974.
4. CZUCHRA, W., A Graphical Method to Solve a Maximin Allocation Problem, European Journal of Operational Research, Vol. 26, pp. 259-261, 1986.
5. Luss, H., and SMITH, D. R., Resource Allocation among Competing Activities: A Lexicographic Minimax Approach, Operations Research Letters, Vol. 5, pp. 227-231, 1986.
6. PANG, J. S., and Yu, C. S., A Minimax Resource Allocation Problem with Substitutions, European Journal of Operational Research, Vol. 41, 218-223, 1989.
7. Luss, H., A Nonlinear Minimax Allocation Problem with Multiple Knapsack Constraints, Operations Research Letters, Vol. 10, pp. 183-187, 1991.
8. KLEIN, R. S., Luss, H., and ROTHBLUM, U. G., Minimax Resource Allocation Problems with Resource Substitutions Represented by Graphs, Operations Research, Vol. 41, pp. 959-971, 1993.
9. JACOBSEN, S., On Marginal Allocation in Single Constraint Minimax Problems, Management Science, Vol. 17, pp. 780-783, 1971.
10. PORTEUS, E. L., and YORMARK, J. S., More on the Minimax Allocation, Management Science, Vol. 18, pp. 520-527, 1972.
11. ICHIMORI, T., On Minimax Integer Allocation Problems, Operations Research, Vol. 32, pp. 449-450, 1984.
12. TANG, C. S., A Minimax Allocation Problem: Its Solutions and Applications, Operations Research, Vol. 36, pp. 359-367, 1988.
13. DREZNER, Z., and WESOLOWSKY, G. O., A Maximal Location Problem with Maximum Distance Constraints, IIE Transactions, Vol. 12, pp. 249-252, 1980.
14. RANGAN, C. P., and GOVINDAN, R., An O(n log n) Algorithm for a Maximin Location Problem, Discrete Applied Mathematics, Vol. 36, pp. 203-205, 1992.
15. AGASI, E., BECKER, R. I., and PERL, Y., A Shifting Algorithm for Constrained Minimax Partition on Trees, Discrete Applied Mathematics, Vol. 45, pp. 1-28, 1993.
16. Yu, G., On the Maximin Knapsack Problem with Robust Optimization Applications, Operations Research, Vol. 44, pp. 407-415, 1996.
17. EISLET, H. A., Continuous Maximin Knapsack Problems with GLB Constraints, Mathematical Programming, Vol. 36, pp. 114-121, 1986.
18. Yu, G., and KOUVELIS, P., Complexity Results for a Class of Minimax Problems with Robust Optimization Applications, Complexity in Numerical Optimization, Edited by P. M. Pardalos, World Scientific Publishing Company, Singapore, pp. 501-509, 1993.
19. LEMARÉCHAL, C., Nondifferentiable Optimization, Handbooks in Operations Research and Management Science, Edited by G. L. Nemhauser, A. H. G. Rinnooy Kan, and M. J. Todd, Elsevier Science Publishers, Amsterdam, Holland, Vol. 1, pp. 529-572, 1989.
20. Luss, H., An Algorithm for Separable Nonlinear Minimax Problems, Operations Research Letters, Vol. 6, pp. 159-162, 1987.
21. POSNER, M. E., and Wu, C. T., Linear Maximin Programming, Mathematical Programming, Vol. 20, pp. 166-172, 1981.
22. BAZARAA, M. S., and GOODE, J. J., An Algorithm for Solving Linearly Constrained Minimax Problems, European Journal of Operational Research, Vol. 11, pp. 158-166, 1982.
23. AHUJA, R. K., Minimax Linear Programming Problem, Operations Research Letters, Vol. 4, pp. 131-134, 1985.
24. DUTTA, R. S. K., and VIDYASAGAR, M., New Algorithm for Constrained Minimax Optimization, Mathematical Programming, Vol. 13, pp. 140-155, 1977.
25. MADSEN, K., and SCHJAER-JACOBSEN, H., Linearly Constrained Minimax Optimization, Mathematical Programming, Vol. 14, pp. 208-223, 1978.
26. VINCENT, T. L., GOH, B. S., and TEO, K. L., Trajectory-Following Algorithms for Minimax Optimization Problems, Journal of Optimization Theory and Applications, Vol. 75, pp. 501-519, 1992.
27. KARP, R. M., Reducibility among Combinatorial Problems, Complexity of Computer Communications, Edited by R. E. Miller and J. W. Thatcher, Plenum Press, New York, New York, pp. 85-103, 1972.
28. GAREY, M, R., and JOHNSON, D. S., Computers and Intractability, W. H. Freeman, San Francisco, California, 1979.
29. PRIM, R. C., Shortest Connection Networks and Some Generalizations, Bell System Technical Journal, Vol. 36, pp. 1389-1401, 1957.
30. KRUSKAL, J. B., On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem, Proceedings of the American Mathematical Society, Vol. 7, pp. 48-50, 1956.
31. WAGNER, H. M., and WHITIN, T., Dynamic Problems in the Theory of the Firm, Theory of Inventory Management, 2nd Edition, Edited by T. Whitin, Princeton University Press, Princeton, New Jersey, 1957.