Citation

Doig AG. OR Oper. Res. Q. (1953) 1963; 14(4): 387-391.

Copyright

(Copyright © 1963, Pergamon Press)

DOI

unavailable

PMID

unavailable

Abstract

In this paper, combinatorial arguments are used to derive a lower bound to the number of basic feasible solutions of a transport problem. A separate argument is given for degenerate and non-degenerate systems, and an example which attains the lower bound is given for each type.