On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach

References

• Agnihothri S., Karmarkar U. S., Kubat P. Stochastic allocation rules. Oper. Res. (1982) 30:545–555Link, Google Scholar
• Ahuja R. K. Minimax linear programming problem. Oper. Res. Lett. (1985) 4:131–134Crossref, Google Scholar
• Ahuja R. K. Algorithms for the minimax transportation problem. Naval Res. Logist. Quart. (1986) 33:725–739Crossref, Google Scholar
• Bazaraa M. S., Goode J. J. An algorithm for solving linearly constrained minimax problems. Eur. J. Oper. Res. (1982) 11:158–166Crossref, Google Scholar
• Betts L. M., Brown J. R. Proportional equity flow problem for terminal arcs. Oper. Res. (1997) 45:521–535Link, Google Scholar
• Betts L. M., Brown J. R., Luss H. Minimax resource allocation problems with ordering constraints. Naval Res. Logist. (1994) 41:719–738Crossref, Google Scholar
• Bitran G. R., Hax A. C. Disaggregation and resource allocation using convex knapsack problems with bounded variables. Management Sci. (1981) 27:431–441Link, Google Scholar
• Brown J. R. The sharing problem. Oper. Res. (1979a) 27:324–340Link, Google Scholar
• Brown J. R. The knapsack sharing problem. Oper. Res. (1979b) 27:341–355Link, Google Scholar
• Brown J. R. The flow circulation sharing problem. Math. Programming (1983) 25:199–227Crossref, Google Scholar
• Brown J. R. The linear sharing problem. Oper. Res. (1984) 32:1087–1106Link, Google Scholar
• Brown J. R. Sharing (maximin and minimax) constrained optimization. (1989) . Working paper, Graduate School of Management, Kent State University, Kent, OHGoogle Scholar
• Brown J. R. Solving knapsack sharing problems with general tradeoff functions. Math. Programming (1991) 51:55–73Crossref, Google Scholar
• Brown J. R. Bounded knapsack sharing. Math. Programming (1994) 67:343–382Crossref, Google Scholar
• Chaddha R. L., Hardgrave W. W., Hudson D. J., Segal M., Suurballe J. W. Allocation of total sample size when only the stratum means are of interest. Technometrics (1971) 13:817–831Crossref, Google Scholar
• Cosares S., Deutsch D. N., Saniee I., Wasem O. J. SONET toolkit: A decision support system for designing robust and cost-effective fiber-optic networks. Interfaces (1995) 25(1):20–40Link, Google Scholar
• Czuchra W. A graphical method to solve a maximin allocation problem. Eur. J. Oper. Res. (1986) 26:259–261Crossref, Google Scholar
• Daskin M. S.Network and Discrete Location: Models, Algorithms, and Applications (1995) (John Wiley, New York) Crossref, Google Scholar
• Dutta S. R. K., Vidyasagar M. New algorithms for constrained minimax optimization. Math. Programming (1977) 13:140–155Crossref, Google Scholar
• Eiselt H. A. Continuous maximin knapsack problems with GLB constraints. Math. Programming (1986) 36:114–121Crossref, Google Scholar
• Garfinkel R. S., Rao M. Bottleneck linear programming. Math. Programming (1976) 11:291–298Crossref, Google Scholar
• Gawande M. Workforce scheduling problems with sideconstraints. (1996) Presented at INFORMS Meeting, Washington, DC, SpringGoogle Scholar
• Ibaraki T., Katoh N.Resource Allocation Problems: Algorithmic Approaches (1988) (MIT Press, Cambridge, MA) Google Scholar
• Ichimori T. On min-max integer allocation problems. Oper. Res. (1984) 32:449–450Link, Google Scholar
• Jacobsen S. On marginal allocation in single constraint min-max problems. Management Sci. (1971) 17:780–783Link, Google Scholar
• Kaplan S. Application of programs with maximin objective functions to problems of optimal resource allocation. Oper. Res. (1974) 22:802–807Link, Google Scholar
• Katoh N., Ibaraki T., Du D.-Z., Pardolos P. M. Resource allocation problems. Handbook of Combinatorial Optimization (1998) 2(Kluwer Academic Publishers, Dordrecht, The Netherlands) 159–260Crossref, Google Scholar
• King J. H. Allocation of scarce resources in manufacturing facilities. AT&T Tech. J. (1989) 68(3):103–113Crossref, Google Scholar
• Klein R. S., Luss H. Minimax resource allocation with tree structured substitutable resources. Oper. Res. (1991) 39:285–295Link, Google Scholar
• Klein R. S., Luss H., Rothblum U. G. Minimax resource allocation problems with resource-substitutions represented by graphs. Oper. Res. (1993) 41:959–971Link, 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
• Klein R. S., Luss H., Rothblum U. G. Multiperiod allocation of substitutable resources. Eur. J. Oper. Res. (1995) 85:488–503Crossref, Google Scholar
• Klein R. S., Luss H., Smith D. R. A lexicographic minimax algorithm for multiperiod resource allocation. Math. Programming (1992) 55:213–234Crossref, Google Scholar
• Kodialam M. S., Luss H. Algorithms for separable nonlinear resource allocation problems. Oper. Res. (1998) 45:274–286Google Scholar
• Kolesar P., Walker W. E. An algorithm for the dynamic relocation of fire companies. Oper. Res. (1974) 22:249–274Link, Google Scholar
• Kouvelis P., Yu G.Robust Discrete Optimization and Its Applications (1997) (Kluwer Academic Publishers, Dordrecht, The Netherlands) Crossref, Google Scholar
• Kuno T., Konno H., Zemel E. A linear-time algorithm for solving continuous maximin knapsack problems. Oper. Res. Lett. (1991) 10:23–26Crossref, Google Scholar
• Kuno T., Mori K., Konno H. A modified GUB algorithm for solving linear minimax problems. Naval Res. Logist. (1989) 36:311–320Crossref, Google Scholar
• Lennon T. M. Comparison of the Luss-Smith algorithm for resource allocation with two linear programming codes. (1991) . Unpublished Manuscript, AT&T Bell LaboratoriesGoogle Scholar
• Luss H. An algorithm for separable nonlinear minimax problems. Oper. Res. Lett. (1987) 6:159–162Crossref, Google Scholar
• Luss H. A nonlinear minimax allocation problem with multiple knapsack constraints. Oper. Res. Lett. (1991) 10:183–187Crossref, Google Scholar
• Luss H. Minimax resource allocation problems: Optimization and parametric analysis. Eur. J. Oper. Res. (1992) 60:76–86Crossref, Google Scholar
• Luss H., Gupta S. K. Allocation of effort resources among competing activities. Oper. Res. (1975) 23:360–366Link, Google Scholar
• Luss H., Rosenwein M. B., Wahls E. T. Integration of planning and execution: Final assembly sequencing. AT&T Tech. J. (1990) 69(4):99–109Crossref, Google Scholar
• Luss H., Smith D. R. Resource allocation among competing activities: A lexicographic minimax approach. Oper. Res. Lett. (1986) 5:227–231Crossref, Google Scholar
• Luss H., Smith D. R. Multiperiod allocation of limited resources: A minimax approach. Naval Res. Logist. (1988) 35:493–501Crossref, Google Scholar
• Madsen K., Schjaer-Jacobsen H. Linearly constrained minimax optimization. Math. Programming (1978) 14:208–223Crossref, Google Scholar
• Marchi E., Oviedo A. Lexicographic optimality in the multiple objective linear programming: The nucleolar solution. Eur. J. Oper. Res. (1992) 57:355–359Crossref, Google Scholar
• Megiddo N. Optimal flows in networks with multiple sources and sinks. Math. Programming (1974) 7:97–107Crossref, Google Scholar
• Megiddo N. A good algorithm for lexicographically optimal flows in multi-terminal networks. Bull. Amer. Math. Soc. (1977) 83:407–409Crossref, Google Scholar
• Meketon M. S. Crew planning models at CONRAIL. (1996) Presented at INFORMS Meeting, Washington, DC, SpringGoogle Scholar
• Mendelson H., Pliskin J. S., Yechiali U. A stochastic allocation problem. Oper. Res. (1980) 28:687–693Link, Google Scholar
• Mjelde K. M. Max-min resource allocation. BIT (1983a) 23:529–537Crossref, Google Scholar
• Mjelde K. M.Methods of Allocation of Limited Resources (1983b) (John Wiley, New York) Google Scholar
• Monden Y.Toyota Production System (1983) (Institute of Industrial Engineers, Industrial Engineering and Management Press, Norcross, GA) Google Scholar
• Munson B. S., Kodialam M. S. Workforce scheduling across multiple teams. (1995) Presented at INFORMS Meeting, Los Angeles, SpringGoogle Scholar
• Nguyen Q. C., Stone R. E. A multiperiod minimax resource allocation problem with substitutable resources. Management Sci. (1993) 39:964–974Link, Google Scholar
• Ogryczak W. On the lexicographic minimax approach to location problems. Eur. J. Oper. Res. (1997) 100:566–585Crossref, Google Scholar
• Pang J.-S., Yu C.-S. A min-max resource allocation problem with substitutions. Eur. J. Oper. Res. (1989) 41:218–223Crossref, Google Scholar
• Porteus E. L., Yormark L. S. More on min-max allocation. Management Sci. (1972) 18:502–507Link, Google Scholar
• Posner M. E., Wu C.-T. Linear max-min programming. Math. Programming (1981) 20:166–172Crossref, Google Scholar
• Tang C. S. A max-min allocation problem: Its solutions and applications. Oper. Res. (1988) 36:359–367Link, Google Scholar
• Vidal R. V. V. A graphical method to solve a family of allocation problems. Eur. J. Oper. Res. (1984) 17:31–34Crossref, Google Scholar
• Yamada T., Futakawa M., Kataoka S. Some exact algorithms for the knapsack sharing problem. IFORS 14th Triennial Conf. (1996) Vancouver, Canada, JulyUnpublished manuscript, Department of Computer Science, The National Defense Academy, Yokosuka, Kanagawa 239, Japan. AlsoGoogle Scholar
• Yu G. On the max-min 0-1 knapsack problem with robust optimization applications. Oper. Res. (1996) 44:407–415Link, Google Scholar
• Zeitlin Z. Integer allocation problems of min-max type with quasiconvex separable functions. Oper. Res. (1981) 29:207–211Link, Google Scholar
• Zipkin P. H. Simple ranking methods for allocation of one resource. Management Sci. (1980) 26:34–43Link, Google Scholar