A specially structured nonlinear integer resource allocation problem Academic Article uri icon

abstract

  • We present an algorithm for solving a specially structured nonlinear integer resource allocation problem. This problem was motivated by a capacity planning study done at a large Health Maintenance Organization in Texas. Specifically, we focus on a class of nonlinear resource allocation problems that involve the minimization of a convex function over one general convex constraint, a set of block diagonal convex constraints, and bounds on the integer variables. The continuous variable problem is also considered. The continuous problem is solved by taking advantage of the structure of the Karush-Kuhn-Tucker (KKT) conditions. This method for solving the continuous problem is then incorporated in a branch and bound algorithm to solve the integer problem. Various reoptimization results, multiplier bounding results, and heuristics are used to improve the efficiency of the algorithms. We show how the algorithms can be extended to obtain a globally optimal solution to the nonconvex version of the problem. We further show that the methods can be applied to problems in production planning and financial optimization. Extensive computational testing of the algorithms is reported for a variety of applications on continuous problems with up to 1,000,000 variables and integer problems with up to 1000 variables.

published proceedings

  • Naval Research Logistics

author list (cited authors)

  • Bretthauer, K. M., Shetty, B., & Syam, S.

citation count

  • 7

complete list of authors

  • Bretthauer, Kurt M||Shetty, Bala||Syam, Siddhartha

publication date

  • October 2003

publisher