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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Doig, A. The Minimum Number of Basic Feasible Solutions to a Transport Problem. J Oper Res Soc 14, 387–391 (1963). https://doi.org/10.1057/jors.1963.62
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.1963.62