No label defined (Q3675897)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3896661
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3896661 |
Statements
1982
0 references
semiadditivity of optimal plans
0 references
optimal solution
0 references
balanced transportation problem
0 references
0.7654150724411011
0 references
0.7597548365592957
0 references
0.7532393932342529
0 references
0.7532391548156738
0 references
0.75027996301651
0 references
[For the entire collection see Zbl 0531.00010.] The main result may be formulated verbally as follows. Let \(X_ 0\) be a set of transportations being contained in a certain optimal solution of a balanced transportation problem, T. Let \(T_ a\) denote the transportation problem in which all the lines corresponding to the transportations from \(X_ 0\) are blocked and, at the same time, the supplies of deliverers and the demands of receivers are decreased according to \(X_ 0\). Then any full plan of transportations \(X=X_ 1\cup X_ 0\) (containing \(X_ 0)\) is an optimal solution of T if and only if \(X_ 1\) is an optimal solution of \(T_ a\).
0 references