.png){kind=icon}
.png){kind=icon}
Return
A minimax resource allocation problem with variable resources
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(01)00078-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The problem of optimally allocating the resources to competing activities where the amounts of the resources are not only previosly given but are also to be determined subject to certain linear constraints is considered. The objective is to find such activity levels such that their weighted deviation from a prespecified target is as small as possible. A primal decomposition approach for the problem and derive an explicit formula for the piecewise affine-linear convex objective function of the upper level problem are suggested. The lower level problem is a parametric optimization problem with a bottleneck objective function. If the constraints on the amounts of the resources are all of knapsack type or if there is only one such constraint, then the upper level problem is equivalent to the lower level problem with fixed right-hand sides. In the general case, the problem can efficiently be solved by means of the level method. (C) 2002 Elsevier Science B.V. All rights reserved.
Keywords:
convex programming
parametric programming
minimax resource allocation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available