Minimax resource allocation problems with ordering constraints

Minimax resource allocation problems with ordering constraints

0.00 Avg rating0 Votes
Article ID: iaor1995404
Country: United States
Volume: 41
Issue: 6
Start Page Number: 719
End Page Number: 738
Publication Date: Oct 1994
Journal: Naval Research Logistics
Authors: ,
Keywords: programming: integer
Abstract:

Resource allocation problems consider the allocation of limited resources among numerous competing activities. The authors address an allocation problem with multiple knapsack resource constraints. The activities are grouped into disjoint sets. Ordering constraints are imposed on the activities within each set, so that the level of one activity cannot exceed the level of another activity in the same set. The objective function is of the minimax type and each performance function is a nonlinear, strictly decreasing and continuous function of a single variable. Applications for such resource allocation problems are found, for example, in high-tech industries confronted with large-scale and complex production planning problems. The authors present two algorithms to solve the allocation problem with ordering constriants. The first one uses characterization of the optimal decision variables to apply a search method. The second algorithm solves a sequence of problems, each in the format of the original problem without ordering constraints. Whereas the computational effort of the first algorithm depends on the desired degree of accuracy even for linear performance functions, the effort of the latter algorithm is polynomial for certain classes of performance functions.

Reviews

Required fields are marked *. Your email address will not be published.