This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: can lead to the optimal integer solution: x 1 + 2 x 2 ≤ 10 cut I , 1 Figure 1: Network for exercise 3, page 405. 3 x 1 + x 2 ≤ 15 cut II . Exercise 5, page 384 Show that, even though the following problem has a feasible integer solution, the fractional cut would not yield a feasible solution unless all the fractions in the constraint were eliminated: maximize z = x 1 + 2 x 2 subject to x 1 + 1 2 x 2 ≤ 13 4 x 1 ≥ , x 2 ≥ 0 and integer . Exercise 3, page 405 For the network shown in Figure 1, it is desirable to ﬁnd the shortest route from 1 to 7. Deﬁne the stages and the states using backward dynamic programming recursion, and solve the problem. 2...
View
Full Document
 Spring '09
 Nedich
 Optimization, Hebrew numerals, integer solution, ﬁrst branching variable

Click to edit the document details