论文信息 - Which matrices are immune against the transportation paradox?

Which matrices are immune against the transportation paradox?

We characterize the m × n cost matrices of the transportation problem for which there exist supplies and demands such that the transportation paradox arises. Our characterization is fairly simple and can be verified within O(mn) computational steps. Moreover, we discuss the corresponding question for the algebraic transportation problem.

[1] Gautam Appa,et al. The Transportation Problem and its Variants , 1973 .

[2] Rainer E. Burkard,et al. Weakly admissible transformations for solving algebraic assignment and transportation problems , 1980 .

[3] U. Zimmermann. Linear and combinatorial optimization in ordered algebraic structures , 1981 .

[4] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .

[5] Gerd Finke. A unified approach to reshipment, overshipment and post-optimization problems , 1978 .

[6] Michael J. Ryan. More on the More for Less Paradox in the Distribution Model , 1980 .

[7] G. Finke. Minimizing Overshipments In Bottleneck Transportation Problems , 1983 .

[8] Rainer E. Burkard. A general Hungarian method for the algebraic transportation problem , 1978, Discret. Math..

[9] Wlodzimierz Szwarc,et al. The Transportation Paradox. , 1971 .

[10] G. M. Appa. Reply to L. G. Proll , 1973 .