This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Now construct a sample input, by drawing a (for example) sevennode directed graph, along with its associated capacities, with a speci²ed source and sink node. Attempt to ²nd an optimal solution by inspection (that is, not by any particular formal algorithm, such as the simplex method. 1 Now start using the PCs, and enter your maximum fow model as a Fle. Construct the associated .dat Fle ±or your sample input. Attempt to solve the problem using AMPL. 2...
View
Full Document
 Spring '07
 SHMOYS/LEWIS
 Linear Programming, Optimization, Flow network, Maximum flow problem, maximum flow

Click to edit the document details