Quadratic resource allocation with generalized upper bounds Export

@article{citeulike:4090952, abstract = {In this paper we present an algorithm for solving a quadratic resource allocation problem that includes a set of generalized upper bound (GUB) constraints. The problem involves minimizing a quadratic function over one linear constraint, a set of GUB constraints, and bounded variables. GUB constraints, when added to a standard resource allocation problem, can be used to set upper limits on the amount of a resource consumed by one or more subsets of the activities. To solve the problem, we present an efficient algorithm that solves a series of quadratic knapsack subproblems and box constrained quadratic subproblems. Computational results are reported for large-scale problems with as many as 100 000 variables and 1000 constraints. The computational results indicate that our algorithm is up to 4000 times faster than the general purpose nonlinear programming software LSGRG.}, author = {Bretthauer, Kurt M. and Shetty, Bala}, citeulike-article-id = {4090952}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/S0167-6377(96)00039-9}, citeulike-linkout-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0167-6377(96)00039-9}, doi = {10.1016/S0167-6377(96)00039-9}, issn = {01676377}, journal = {Operations Research Letters}, keywords = {article, masters, pegging, quadratic}, month = {February}, number = {2}, pages = {51--57}, posted-at = {2009-02-24 03:19:03}, priority = {2}, title = {Quadratic resource allocation with generalized upper bounds}, url = {http://dx.doi.org/10.1016/S0167-6377(96)00039-9}, volume = {20}, year = {1997} }

TY - JOUR ID - citeulike:4090952 L3 - citeulike-article-id:4090952 N2 - In this paper we present an algorithm for solving a quadratic resource allocation problem that includes a set of generalized upper bound (GUB) constraints. The problem involves minimizing a quadratic function over one linear constraint, a set of GUB constraints, and bounded variables. GUB constraints, when added to a standard resource allocation problem, can be used to set upper limits on the amount of a resource consumed by one or more subsets of the activities. To solve the problem, we present an efficient algorithm that solves a series of quadratic knapsack subproblems and box constrained quadratic subproblems. Computational results are reported for large-scale problems with as many as 100 000 variables and 1000 constraints. The computational results indicate that our algorithm is up to 4000 times faster than the general purpose nonlinear programming software LSGRG. IS - 2 JF - Operations Research Letters SN - 01676377 EP - 57 TI - Quadratic resource allocation with generalized upper bounds VL - 20 SP - 51 KW - article KW - masters KW - pegging KW - quadratic AU - Bretthauer, Kurt AU - Shetty, Bala PY - 1997/02// UR - http://dx.doi.org/10.1016/S0167-6377(96)00039-9 ER -