We present an algorithm to solve resource allocation problems with a single resource, a convex separable objective function, a convex separable resource-usage constraint and bounded variables. Through evaluation of specific functions in the lower and/or upper bounds, we obtain information on whether or not these bounds are binding. Once this information is available for all variables, the optimum is found through determination of the unique root of a strictly decreasing function. A comparison is made with the currently known most efficient algorithms.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number
40.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: