The Transportation Problem and its Variants
The Transportation Problem and its Variants
复制标题
交通问题及其变体
DOI：
10.1057/jors.1973.10
复制
发表时间：
1973
影响因子：
3.6
通讯作者：
Gautam M. Appa
中科院分区：
文献类型：
--
作者：
Gautam M. Appa
对于54个单模线性规划问题，证明了(i)目标函数无界，或（ii）问题不可行，或（iii）问题可以通过求解相关的运输问题来解决。相关的运输问题是通过在原问题上最多增加两个新的约束而得到的。
For 54 unimodular linear programming problems it is shown that either (i) the objective function is unbounded, or (ii) the problem is infeasible, or (iii) the problem can be solved by solving a related transportation problem. The related transportation problem is obtained by addingat the most two new constraintsto the original problem.