Each of the following depicts a minimum cost network flow problem, with labels on nodes indicating net demand and those on arcs showing unit cost and capacity. Determine for each (without solving) whether any unique optimal flow would have to be integer valued.

Transcribed Image Text:

(a) (1,5) (1,5) (6,00) -10(2 (10,30) (5,40) 4-10 20 20