Abstract
The calculation routines of simplex, transportation, aircraft routing, generalized, capacitated and multi-index problems are shown to be special cases of a general method of linear programming. The relationship between these routines is shown and the formulation enables new methods to be created.

This publication has 0 references indexed in Scilit: