TY - JOUR PY - 1963// TI - The Minimum Number of Basic Feasible Solutions to a Transport Problem JO - OR: Operational research quarterly (1953) A1 - Doig, Alison G. SP - 387 EP - 391 VL - 14 IS - 4 N2 - 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.
LA - SN - 1473-2858 UR - http://dx.doi.org/ ID - ref1 ER -