Recently Deineko, Klinz, and Woeginger have shown that a transportation
problem is immune against the "more for less"-paradox if and only if the
cost matrix C = (c_{i,j}) (of dimension m × n) does not contain a bad
quadruple. In this note a counter-example with infinite-dimensional supply
and demand vectors is given. In the second part we show that the
quadruple-characterization of paradox-immune cost matrices remains valid in
the infinite-dimensional case in a slightly weaker form. As a side result a
smooth inequality is obtained for the situation where a transportation plan
is split in two or more arbitrary subplans.
Keywords: transportation problem - infinite transportation problem -
transportation paradox - combinatorial optimization