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 ...

In the linear programming approach to approximate dynamic programming, one tries to solve a certain linear program-the ALP-that has a relatively small number K of variables but an intractable number M ...