The following example shows how to find the minimum cost flow through a network using linear programming. The arcs are defined by an array of tuples; each tuple names a new arc.

Michael H. Veatch, Approximate Linear Programming for Average Cost MDPs, Mathematics of Operations Research, Vol. 38, No. 3 (August 2013), pp. 535-544 ...

Three examples of the applications of linear programming are given, drawn from the manufacture of plywood, the distribution of grain, and industrial fermentation. In each of these widely different ...