Answers are grounded in this paper and cite their sources.
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 adding at the most two new constraints to the original problem.
No takes yet. Share an insight, caveat, or question.
Gautam Appa (1973) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: