Algorithms for Separable Nonlinear Resource Allocation Problems
A simple resource allocation problem with a single resource constraint is considered. The objective function is composed of several separable, convex performance functions, 1 for each activity. Likewise, the constraint has separable, convex resource-usage functions, 1 for each activity. The objectiv...
Uloženo v:
| Vydáno v: | Operations research Ročník 46; číslo 2; s. 272 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Linthicum
Institute for Operations Research and the Management Sciences
01.03.1998
|
| Témata: | |
| ISSN: | 0030-364X, 1526-5463 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | A simple resource allocation problem with a single resource constraint is considered. The objective function is composed of several separable, convex performance functions, 1 for each activity. Likewise, the constraint has separable, convex resource-usage functions, 1 for each activity. The objective is to minimize the sum of the performance functions, subject to satisfying the resource constraint and nonnegativity constraints. This problem extends the well-studied problem in which the resource constraint is linear. Several algorithms are presented to solve the problem. These algorithms extend approaches developed for the linearly constrained problem. They can readily solve large problems magnifying the optimal solution in a number of iterations that does not exceed the number of variables. Several examples are provided for illustration purposes, occupational result are presented, and the similarities and differences among the algorithms are highlighted. |
|---|---|
| Bibliografie: | ObjectType-Article-1 SourceType-Scholarly Journals-1 content type line 14 |
| ISSN: | 0030-364X 1526-5463 |
| DOI: | 10.1287/opre.46.2.272 |