{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

homework-13

# homework-13 - s to t on the following graph As we did in...

This preview shows page 1. Sign up to view the full content.

MthSc810 – Mathematical Programming Fall 2011, Homework #13. Due Thursday, December 8, 2011, 6PM EDT. From the syllabus: homework will be penalized 50% for each day they are late. After two days, they will not be accepted. No exception. Problem 1. Compute G ( c ) for the following problem, where c = ( c 1 , c 2 ): min c 1 x 1 + c 2 x 2 x 1 - x 2 1 x 1 , x 2 0 . Problem 2. Solve the problem of ±nding the maximum ²ow from
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: s to t on the following graph. As we did in class, repeatedly ±nd the augmenting path and, if one exists, augment the ²ow. Start with any feasible (but sub-optimal) ²ow. Next to each arc is its capacity. After you have found the optimal ²ow, determine a cut with minimum capacity. A B C 8 5 6 5 7 9 s t...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online