Algorithms for Separable Nonlinear Resource Allocation Problems

Published Online:https://doi.org/10.1287/opre.46.2.272

References

  • Bitran G. R. , Hax A. C. Disaggregation and resource allocation using convex knapsack problems with bounded variables. Management Sci. (1981) 27 431 441 LinkGoogle Scholar
  • Bretthauer K. M. , Shetty B. The nonlinear resource allocation problem. Opns. Res. (1995) 43 670 683 LinkGoogle Scholar
  • Charnes A. , Cooper W. W. The theory of search: Optimal distribution of effort. Management Sci. (1958) 5 44 49 LinkGoogle Scholar
  • Cormen T. H. , Leiserson C. E. , Rivest R. L. Introduction to Algorithms (1991) (MIT Press, Cambridge, MA) Google Scholar
  • Czuchra W. A graphical method to solve a maximin allocation problem. Eur. J. Opl. Res. (1986) 26 259 261 CrossrefGoogle Scholar
  • Einbu J. M. Extension of the Luss-Gupta resource allocation algorithm by means of first order approximation techniques. Opns. Res. (1981) 29 621 626 LinkGoogle Scholar
  • Grotzinger S. J. , Srinivasan R. , Akella R. , Bollapragada S. Component procurement and allocation for products assembled to forecast: Risk-polling effects. IBM J. Res. Development (1993) 37 523 535 CrossrefGoogle Scholar
  • Ibaraki T. , Katoh N. Resource Allocation Problems: Algorithmic Approaches (1988) (MIT Press, Cambridge, Massachusetts) Google Scholar
  • Luss H. An algorithm for separable nonlinear minimax problems. O. R. Lett. (1987) 6 159 162 CrossrefGoogle Scholar
  • Luss H. A nonlinear minimax allocation problem with multiple knapsack constraints. O. R. Lett. (1991) 10 183 187 CrossrefGoogle Scholar
  • Luss H. Minimax resource allocation problems. Optimization and parametric analysis. Eur. J. Opl. Res. (1992) 60 76 86 CrossrefGoogle Scholar
  • Luss H. , Gupta S. K. Allocation of effort resources among competing activities. Opns. Res. (1975) 23 360 366 LinkGoogle Scholar
  • Luss H. , Smith D. R. Resource allocation among competing activities: A lexicographic minimax approach. O. R. Lett. (1986) 5 227 231 CrossrefGoogle Scholar
  • Minoux M. Mathematical Programming: Theory and Algorithms (1986) (John Wiley, New York) Google Scholar
  • Segal M. Staging. TIMS/ORSA Bulletin (1993) . 35th Joint National Meeting, Chicago, May Google Scholar
  • Tang C. S. A max-min allocation problem: Its solutions and applications. Opns. Res. (1988) 36 359 367 LinkGoogle Scholar
  • Wilkinson C. , Gupta S. K. Allocating promotional effort to competing activities: A dynamic programming approach. IFORS Conf. (1969) Venice 419 432 Google Scholar
  • Zipkin P. H. Simple ranking methods for allocation of one resource. Management Sci. (1980) 26 34 43 LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.