Abstract
This paper presents methods for solving allocation problems that can be stated as convex knapsack problems with generalized upper bounds. Such bounds may express upper limits on the total amount allocated to each of several subsets of activities. In addition our model arises as a subproblem in more complex mathematical programs. We therefore emphasize efficient procedures to recover optimality when minor changes in the parameters occur from one problem instance to the next. These considerations lead us to propose novel data structures for such problems. Also, we introduce an approximation method to solve certain equations, which arise during the procedures.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Aho, J. Hopcroft and J. Ullman,The design and analysis of computer algorithms (Addison-Wesley, Reading, MA, 1974).
G. Bitran and A. Hax, “Disaggregation and resource allocation using convex knapsack problems with bounded variables”,Management Science 27 (1981) 431–441.
L. Bodin, “Optimization procedures for the analysis of coherent structures”,IEEE Transactions on Reliability R-18 (1969) 118–126.
A. Federgruen and P. Zipkin, “A combined vehicle-routing/inventory-allocation model” Research working paper, Graduate School of Business, Columbia University, NY (1980).
B. Fox, “Data structures and computer science techniques in operations research”,Operations Research 26 (1978) 686–717.
B. Fox, “Accelerating list processing in discrete optimization”,Journal of the ACM 17 (1970) 383–384.
F. Glover and D. Klingman, “A O(n logn) algorithm for LP knapsacks with GUB constraints”,Mathematical Programming 17 (1979) 345–361.
T. Ibaraki, “Resource allocation with a convex objective function and its generalizations”, Working Paper, Dept. of Applied Mathematics and Physics, Faculty of Engineering, Kyoto University, Kyoto, Japan (1980).
D. Knuth,The art of computer programming, Vol. 1 (Addison-Wesley, Reading, MA, 1968).
H. Luss and S. Gupta, “Allocation of effort resources among competing activities”,Operations Research 23 (1975) 360–366.
R. Meyer, “A class of nonlinear integer programs solvable by a single linear program”,SIAM Journal on Control and Optimization 15 (1977) 935–946.
A. Ohuchi and I. Kaji, “Algorithms for optimal allocation problems having quadratic objective functions”,Journal of the Operations Research Society of Japan 23 (1980) 64–80.
J. Rohn, “Productivity of activities in the optimal allocation of one resource”, Working paper, Charles University, Prague (1979).
L. Schrage, “Implicit representation of generalized upper bounds in linear programming”,Mathematical programming 14 (1978) 11–20.
I. Weinstein and S. Yu, Comment on an integer maximization problem,Operations Research 21 (1973) 648–650.
P. Zipkin, “Simple ranking methods for allocation of one resource”,Management Science 26 (1980) 34–43.
P. Zipkin, “Exact and approximate cost functions for product aggregates”,Management Science (to appear).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Federgruen, A., Zipkin, P. Solution techniques for some allocation problems. Mathematical Programming 25, 13–24 (1983). https://doi.org/10.1007/BF02591716
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02591716