A Min-Max-Sum Resource Allocation Problem and Its Applications

References

• Bazaraa M. S., Shetty C. M.Nonlinear Programming: Theory and Algorithms (1979) (John Wiley & Sons, New York) Google Scholar
• Bodin L. D. Optimization procedure for the analysis of coherent structures. IEEE Trans. on Reliability (1969) R-18(3):118–126Crossref, Google Scholar
• Charnes A., Cooper W. W. The theory of search: Optimal disrtribution of search effort. Management Sci. (1958) 5:44–49Link, Google Scholar
• Djerdjour M., Mathur K., Salkin H. M. A surrogate relaxation based algorithm for a general quadratic multi-dimensional knapsack problem. Oper. Res. Lett. (1998) 7(5):253–258Crossref, Google Scholar
• Gavish B., Pirkul H. Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality. Math. Programming (1985) 31:78–105Crossref, Google Scholar
• Glover F. Surrogate constraint duality in mathematical programming. Oper. Res. (1975) 23:434–453Link, Google Scholar
• Greenberg H. J., Pierskalla W. P. Surrogate mathematical programs. Oper. Res. (1970) 18:924–939Link, Google Scholar
• Held M., Wolfe P., Crowder H. P. Validation of subgradient optimization. Math. Programming (1974) 6:62–68Crossref, Google Scholar
• Ibaraki T., Katoh N.Resource Allocation Problems: Algorithmic Approaches (1988) (MIT Press, Cambridge, MA) Google Scholar
• Karabati S., Kouvelis P., Yu G. The discrete resource allocation problem in flow lines. Management Sci. (1995) 41(9):1417–1430Link, Google Scholar
• Karabati S., Kouvelis P., Yu G. A min-max-sum resource allocation problem and its applications. (1996) . Working paper 1996/08. ( www.ku.edu.tr/faculty/working.html). Koç University, Istanbul, TurkeyGoogle Scholar
• Karwan M. H., Rardin R. L. Some relationships between lagrangian and surrogate duality in integer programming. Math. Programming (1979) 17:320–334Crossref, Google Scholar
• Klein R. S., Luss H., Rothblum U. G. Relaxation-based algorithms for minimax optimization problems with resource allocation applications. Math. Programming (1994) 64:337–363Crossref, Google Scholar
• Kodialam M. S., Luss H. Algorithms for seperable nonlinear resource allocation problems. Oper. Res. (1998) 46(2):272–284Link, Google Scholar
• Kouvelis P., Yu G.Robust Discrete Optimaization and its Applications (1997) (Kluwer Academic Publishers, Dordrecht, The Netherlands) Crossref, Google Scholar
• Lee W. J., Gabot A. V., Venkataramanan M. A. A branch and bound algorithm for solving separable convex integer programming problems. Comput. and Oper. Res. (1994) 21(9):1011–1024Crossref, Google Scholar
• Lilien G. L., Kotler P., Moorthy K. S.Marketing Models (1992) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Luss H. A nonlinear minimax allocation problem with multiple knapsack constraints. Oper. Res. Lett. (1991) 10:183–187Crossref, Google Scholar
• Luss H. On equitable resource allocation problems: A lexicographic minimax approach. Oper. Res. (1999) 47(3):361–378Link, Google Scholar
• Mjelde K. M.Methods of Allocation of Limited Resources (1983) (John Wiley, New York) Google Scholar
• Papadimitriou C. H., Steiglitz K.Combinatorial Optimization: Algorithms and Complexity (1982) (Prentice-Hall, Inc,, Englewood Cliffs, NJ) Google Scholar
• Tang C. A max-min allocation problem: its solutions and applications. Oper. Res. (1988) 36(2):359–367Link, Google Scholar
• Trietsch D., Baker K. R. Basic techniques for lot streaming. Oper. Res. (1993) 41(6):1065–1076Link, Google Scholar