|
Поиск атрибутный
| |
|
|
|
Transport-type problems with a minimax criterion
Аннотация
The set of all matrix-plans of a standard transport problem is studied. The largest element of a matrix of this set and the sum of the largest element in a matrix and the largest elements in every column and row of this matrix are goal functions. The minimum of every goal function is determined and an optimal matrix is constructed on which all goal functions attain their minimum. The minimax case for integral matrix-plans of a transport problem is treated separately. Ключевые слова
matrix-plans; transport problem |
|