Screen shots

The following screen shot sequence shows the tipical steps involved while solving a Minimum Cost Flow network problem, in this case, the PFMCEXX1 problem!

Click an image to enlarge

(1/4) The problem in DIMACS Challenge Min Extended format, shown in the text editor Kate	(2/4) Octave while solving
(3/4) PDF Output double page 1/2	(4/4) Single output page showing the optimum solution for the problem PFMCEXX1 2/2

List of examples

In this page you can find a list of problems (networks) and the steps followed by the Simplex FMC to solve them. The solutions are displayed in PDF format.

Problem Name	Description	Problem File	Solution	Uses Extended Format?	Shiped in Package?
PFMCEXX1	Very basic network of 4 nodes and 5 arcs. Problem solved with Big-M and displaying the Thread array in light red			no	yes
PFMC100	Simple network of 6 nodes and 10 arcs. Solved with Fase I/II and displaying the Depth array			yes	yes
PFMC200	Another simple network of 6 nodes and 10 arcs. Solved with Big-M showing the Thread (in blue) and Depth arrays			no	yes
PFMC201	Same as above but solved from an initial feasable solution given in the same min file.			yes	yes
PFMC300	Simple network of 5 nodes and 8 arcs. Solved with Big-M			no	yes
	Same as above but solved with Fase I/II			no	yes
PFMC301	A variation of problem PFM300 using infinite upperbound on some arcs. Solved with Fase I/II and showing the TREAD array			no	yes