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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.