Algorithms for the continuous nonlinear resource allocation problem - New implementations and numerical studies

Patriksson (2008) provided a then up-to-date survey on the continuous, separable, differentiable and convex resource allocation problem with a single resource constraint. Since the publication of that paper the interest in the problem has grown: several new applications have arisen where the problem at hand constitutes a subproblem, and several new algorithms have been developed for its efficient solution. This paper therefore serves three purposes. First, it provides an up-to-date extension of the survey of the literature of the field, complementing the survey in Patriksson (2008) with more then 20 books and articles. Second, it contributes improvements of some of these algorithms, in particular with an improvement of the pegging (that is, variable fixing) process in the relaxation algorithm, and an improved means to evaluate subsolutions. Third, it numerically evaluates several relaxation (primal) and breakpoint (dual) algorithms, incorporating a variety of pegging strategies, as well as a quasi-Newton method. Our conclusion is that our modification of the relaxation algorithm performs the best. At least for problem sizes up to 30 million variables the practical time complexity for the breakpoint and relaxation algorithms is linear.

[1]  Dorit S. Hochbaum,et al.  Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems , 1994, Math. Oper. Res..

[2]  Torbjörn Larsson,et al.  Convergent Lagrangian heuristics for nonlinear minimum cost network flows , 2008, Eur. J. Oper. Res..

[3]  Geraldo Galdino de Paula,et al.  A linear-time median-finding algorithm for projecting a vector on the simplex of Rn , 1989 .

[4]  A. Fischer.  A special newton-type optimization method , 1992 .

[5]  Bala Shetty,et al.  The Nonlinear Resource Allocation Problem , 1995, Oper. Res..

[6]  Hanan Luss,et al.  Algorithms for Separable Nonlinear Resource Allocation Problems , 1998, Oper. Res..

[7]  Anja De Waegenaere,et al.  A breakpoint search approach for convex resource allocation problems with bounded variables , 2012, Optim. Lett..

[8]  Arnoldo C. Hax,et al.  On the Solution of Convex Knapsack Problems with Bounded Variables. , 1977 .

[9]  Siddhartha S. Syam,et al.  A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems , 1995, INFORMS J. Comput..

[10]  A. Ali,et al.  Technical Note - Computational Comparison among Three Multicommodity Network Flow Algorithms , 1980, Oper. Res..

[11]  K. Kiwiel.  On Linear-Time Algorithms for the Continuous Quadratic Knapsack Problem , 2007 .

[12]  Cerry M. Klein,et al.  Constrained multi-item inventory systems: An implicit approach , 1993, Comput. Oper. Res..

[13]  Bernard O. Koopman,et al.  The Optimum Distribution of Effort , 1953, Oper. Res..

[14]  Roberto Cominetti,et al.  A Newton’s method for the continuous quadratic knapsack problem , 2014, Math. Program. Comput..

[15]  L. Bodin,et al.  Optimization Procedure for the Analysis of Coherent Structures , 1969 .

[16]  Bala Shetty,et al.  A pegging algorithm for the nonlinear resource allocation problem , 2002, Comput. Oper. Res..

[17]  Xiaoling Sun,et al.  Nonlinear Integer Programming , 2006 .

[18]  Liming Liu,et al.  Resource Allocation in Multisite Service Systems with Intersite Customer Flows , 2003, Manag. Sci..

[19]  Stefan M. Stefanov.  Convex Quadratic Minimization Subject to a Linear Constraint and Box Constraints , 2004 .

[20]  L. Bayón,et al.  An Exact Algorithm for the Continuous Quadratic Knapsack Problem via Infimal Convolution , 2013, Handbook of Optimization.

[21]  Y. Censor,et al.  An iterative row-action method for interval convex programming , 1981 .

[22]  BIN ZHANG,et al.  Heuristic and Exact Solution Method for Convex nonlinear Knapsack Problem , 2012, Asia Pac. J. Oper. Res..

[23]  J. J. Moré,et al.  Algorithms for bound constrained quadratic programming problems , 1989 .

[24]  Antonio Frangioni,et al.  A library for continuous convex separable quadratic knapsack problems , 2013, Eur. J. Oper. Res..

[25]  Chih-Hang Wu,et al.  Solving large-scale nonlinear stochastic network problems , 2000 .

[26]  Arnoldo C. Hax,et al.  Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables , 1981 .

[27]  Awi Federgruen,et al.  Solution techniques for some allocation problems , 1983, Math. Program..

[28]  Toshihide Ibaraki,et al.  Resource allocation problems - algorithmic approaches , 1988, MIT Press series in the foundations of computing.

[29]  Azuma Ohuchi,et al.  Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs , 1984, Networks.

[30]  K. Schittkowski,et al.  NONLINEAR PROGRAMMING , 2022 .

[31]  Fred Hanssmann.  Operations research techniques for capital investment , 1968 .

[32]  Stefan M. Stefanov.  Convex Separable Minimization Subject to Bounded Variables , 2001, Comput. Optim. Appl..

[33]  Dorit S. Hochbaum,et al.  About strongly polynomial time algorithms for quadratic optimization over submodular constraints , 1995, Math. Program..

[34]  Jeffery L. Kennington,et al.  A polynomially bounded algorithm for a singly constrained quadratic program , 1980, Math. Program..

[35]  K. M. Mjelde.  Methods of the Allocation of Limited Resources , 1983 .

[36]  Stavros A. Zenios,et al.  Massively Parallel Algorithms for Singly Constrained Convex Programs , 1992, INFORMS J. Comput..

[37]  W. Kirsch.  Gewinn und Rentabilität , 1968 .

[38]  James T. Hungerford,et al.  THE SEPARABLE CONVEX QUADRATIC KNAPSACK PROBLEM , 2013 .

[39]  Bala Shetty,et al.  A Model for Resource Constrained Production and Inventory Management , 1994 .

[40]  Arthur F. Veinott,et al.  Analysis of Inventory Systems , 1963 .

[41]  P. Brucker.  Review of recent development: An O( n) algorithm for quadratic knapsack problems , 1984 .

[42]  N. Maculan,et al.  An O(n) Algorithm for Projecting a Vector on the Intersection of a Hyperplane and a Box in Rn , 2003 .

[43]  Dorit S. Hochbaum,et al.  Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources , 1994, Math. Oper. Res..

[44]  Gitae Kim,et al.  A pegging algorithm for separable continuous nonlinear knapsack problems with box constraints , 2012 .

[45]  Jose A. Ventura,et al.  Minimizing single-machine completion time variance , 1995 .

[46]  Siddhartha S. Syam,et al.  A Projection Method for the Integer Quadratic Knapsack Problem , 1996 .

[47]  Jose A. Ventura,et al.  Computational development of a lagrangian dual approach for quadratic networks , 1991, Networks.

[48]  Liping Zhang.  A Newton-Type Algorithm for Solving Problems of Search Theory , 2013, Adv. Oper. Res..

[49]  Roger Fletcher,et al.  New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds , 2006, Math. Program..

[50]  Arthur M. Geoffrion,et al.  Solving Bicriterion Mathematical Programs , 1967, Oper. Res..

[51]  F. John.  Extremum Problems with Inequalities as Subsidiary Conditions , 2014 .

[52]  Jean-Pierre Dussault,et al.  Convex quadratic programming with one constraint and bounded variables , 1986, Math. Program..

[53]  Michel Minoux,et al.  A $O(n)$ algorithm for projecting a vector on the intersection of a hyperplane and $R^n_+$ , 1997 .

[54]  Arthur M Geoffrion.  ON SOLVING BI-CRITERION MATHEMATICAL PROGRAMS , 1965 .

[55]  Roland N. Mckean.  Criteria for the Selection of Water-Resource Projects , 1956 .

[56]  Zhongsheng Hua,et al.  An approximate dynamic programming approach to convex quadratic knapsack problems , 2006, Comput. Oper. Res..

[57]  Bala Shetty,et al.  The nonlinear knapsack problem - algorithms and applications , 2002, Eur. J. Oper. Res..

[58]  Steven J. Erlebacher.  OPTIMAL AND HEURISTIC SOLUTIONS FOR THE MULTI‐ITEM NEWSVENDOR PROBLEM WITH A SINGLE CAPACITY CONSTRAINT , 1996 .

[59]  Zhang Bin.  Direct algorithm for separable continuous convex quadratic knapsack problem , 2005 .

[60]  Layek Abdel-Malek,et al.  Exact, approximate, and generic iterative models for the multi-product Newsboy problem with budget constraint , 2004 .

[61]  A. G. Robinson,et al.  On the continuous quadratic knapsack problem , 1992, Math. Program..

[62]  Wei Shih.  A Branch and Bound Procedure for a Class of Discrete Resource Allocation Problems with Several Constraints , 1977 .

[63]  Paul H. Zipkin,et al.  Simple Ranking Methods for Allocation of One Resource , 1980 .

[64]  Nimrod Megiddo,et al.  Linear time algorithms for some separable quadratic programming problems , 1993, Oper. Res. Lett..

[65]  Bala Shetty,et al.  Quadratic resource allocation with generalized upper bounds , 1997, Oper. Res. Lett..

[66]  Clovis de Faro,et al.  A Simple Algorithm for Stone's Version of the Portfolio Selection Problem , 1975, Journal of Financial and Quantitative Analysis.

[67]  Zhongsheng Hua,et al.  A unified method for a class of convex separable nonlinear knapsack problems , 2008, Eur. J. Oper. Res..

[68]  Bala Shetty,et al.  Production and inventory management under multiple resource constraints , 2006, Math. Comput. Model..

[69]  B. O. Koopman.  Search and Screening: General Principles and Historical Applications , 1980 .

[70]  R. Cottle,et al.  A Lagrangean relaxation algorithm for the constrained matrix problem , 1986 .

[71]  C. Michelot.  A finite algorithm for finding the projection of a point onto the canonical simplex of ∝n , 1986 .

[72]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[73]  Bala Shetty,et al.  Nonlinear integer programming for optimal allocation in stratified sampling , 1999, Eur. J. Oper. Res..

[74]  Surjeet Kaur Suneja,et al.  Convex programming with single separable constraint and bounded variables , 2007, Comput. Optim. Appl..

[75]  K. M. Mjelde.  Allocation of resources according to a fractional objective , 1978 .

[76]  Michael Patriksson,et al.  A survey on the continuous nonlinear resource allocation problem , 2008, Eur. J. Oper. Res..

[77]  A. Tamir.  Efficient Algorithms for a Selection Problem with Nested Constraints and Its Application to a Production-Sales Planning Model , 1980 .

[78]  A. Propoi.  On the Theory of Max-Min , 1977 .

[79]  A. Melman,et al.  An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems , 2000, SIAM Rev..

[80]  Krzysztof C. Kiwiel,et al.  Breakpoint searching algorithms for the continuous quadratic knapsack problem , 2007, Math. Program..

[81]  William H. Press,et al.  Numerical Recipes in FORTRAN - The Art of Scientific Computing, 2nd Edition , 1987 .

[82]  Jorge J. Moré,et al.  Digital Object Identifier (DOI) 10.1007/s101070100263 , 2001 .

[83]  Michael C. Ferris,et al.  Semismooth support vector machines , 2004, Math. Program..

[84]  Hanan Luss.  Equitable Resource Allocation: Models, Algorithms and Applications , 2012 .

[85]  Bala Shetty,et al.  A Parallel Projection for the Multicommodity Network Model , 1990 .

[86]  Panos M. Pardalos,et al.  An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds , 1990, Math. Program..

[87]  Gabriel R. Bitran,et al.  Tradeoff Curves, Targeting and Balancing in Manufacturing Queueing Networks , 1989, Oper. Res..

[88]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[89]  Stephen E. Wright,et al.  Solving the continuous nonlinear resource allocation problem with an interior point method , 2013, Oper. Res. Lett..

[90]  G. Dantzig,et al.  FINDING A CYCLE IN A GRAPH WITH MINIMUM COST TO TIME RATIO WITH APPLICATION TO A SHIP ROUTING PROBLEM , 1966 .

[91]  Anja De Waegenaere,et al.  Optimal tax depreciation lives and charges under regulatory constraints , 2002, OR Spectr..

[92]  A. Charnes,et al.  The Theory of Search: Optimum Distribution of Search Effort , 1958 .

[93]  J. J. Moré,et al.  Quasi-Newton updates with bounds , 1987 .

[94]  Hanan Luss,et al.  Technical Note - Allocation of Effort Resources among Competing Activities , 1975, Oper. Res..

[95]  P. Tseng.  Dual ascent methods for problems with strictly convex costs and linear constraints: a unified approach , 1990 .

[96]  L. Stone.  Search and Screening: General Principles with Historical Applications (B. O. Koopman) , 1981 .

[97]  Krzysztof C. Kiwiel,et al.  On Floyd and Rivest's SELECT algorithm , 2005, Theor. Comput. Sci..

[98]  K. Kiwiel.  Variable Fixing Algorithms for the Continuous Quadratic Knapsack Problem , 2008 .