Resource allocation problems with expensive function evaluations

Abstract

The resource allocation problem is among the classical problems in operations research, and has been studied extensively for decades. However, current solution approaches are not able to efficiently handle problems with expensive function evaluations, which can occur in a variety of applications. We study the integer resource allocation problem with expensive function evaluations, for both convex and non-convex separable cost functions. We present several solution methods, both heuristics and exact methods, that aim to limit the number of function evaluations.The methods are compared in numerical experiments using both randomly generated instances and instances from two resource allocation problems occurring in radiation therapy planning. The best performing method depends on the problem type, and savings in number of function evaluations can be substantial.