A min-max resource allocation problem with substitutions (Q1262219)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A min-max resource allocation problem with substitutions |
scientific article; zbMATH DE number 4123536
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A min-max resource allocation problem with substitutions |
scientific article; zbMATH DE number 4123536 |
Statements
A min-max resource allocation problem with substitutions (English)
0 references
1989
0 references
A model for resource allocation with substitution using a min-max objective is presented. Two resources are substitutable if they can be used in place of one another in the allocation process. The authors show how this model can be solved by a parametric transportation algorithm. They have implemented the algorithm and tested out its efficiency on randomly generated problems. The computational results show that this specialized algorithm is capable of handling reasonably large sized problems encountered in practice quite efficiently.
0 references
resource allocation
0 references
substitution
0 references
min-max objective
0 references
parametric transportation algorithm
0 references
computational results
0 references
0 references
