rec2 - Now construct a sample input by drawing a(for...

This preview shows pages 1–2. Sign up to view the full content.

ORIE 321/521 RECITATION 2 Spring 2007 Write out an AMPL model for the maximum Fow problem. In this model, you should let VERTICES be the name of the set used for the nodes in the input, you should let EDGES be the name for the set used to specify the edges in the input directed graph, you should have let SOURCE be the name used for the source node, and let SINK be the name used for the sink node. ±inally, you should let FLOW[i,j] be the variable name used for the maximum Fow to be computed. Write out the full AMPL model.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Now construct a sample input, by drawing a (for example) seven-node di-rected 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

{[ snackBarMessage ]}

Page1 / 2

rec2 - Now construct a sample input by drawing a(for...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online