This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CO250/CM340 INTRODUCTION TO OPTIMIZATION  HW 6 SOLUTIONS Exercise 1 (25 marks) . (a) If there is a topological ordering y and a directed cycle i 1 i 2 ,i 2 i 3 ,...,i k 1 i k ,i k i 1 then y i 1 > y i 2 + 1 > y i 3 + 2 > ··· > y i k + k 1 > y i 1 + k , a contradiction. (b) (P ) is the following. max x a + x b + x c + x d + x e + x f + x g subject to x a x b = x d + x c x a = x d x e = x f + x b x c x g = x e + x g x f = x z ≥ ( z ∈ { a,b,c,d,e,f,g } ) . (c) This is feasible since x z = 0 for all z ∈ ~ E is a feasible solution. The same works for the arbitrary (P). (d) For (P ): for an arbitrary number b ≥ we can let x f = x g = b , and x z = 0 otherwise. This is feasible. The objective function is 2 b , so it is unbounded. For (P): If there is a directed cycle, set x e = b for all edges e in the cycle, and x e = 0 otherwise, where b ≥ . Then this is a feasible solution, because each constraint with an edge of the cycle corresponds to a vertex v . There must be exactly one arc of the cycle going into v and one going out. The variables corresponding to these arcs have value b each and have opposite signs in the constraint corresponding to v , and all other arcs involved with v have value 0. So the constraint is satisfied. (For a vertex not involved in the cycle, the constraint says 0 = 0 ). The value of this solution is b times the number of arcs in the cycle, so it is unbounded. (e) The dual is (D): min subject to y i y j ≥ 1 (for all e = ij ∈ ~ E ) y i free (for all i ∈ V ) The dual of (P ) is the following. 1 2 max subject to y 1 y 2 ≥ 1 y 4 y 1 ≥ 1 y 2 y 4 ≥ 1 y 2 y 3 ≥ 1 y 5 y 3 ≥ 1 y 4 y 5 ≥ 1 y 5 y 4 ≥ 1 y i free ( i ∈ { 1 ,..., 5 } ) . (f) A topological ordering satisfies exactly the constraints given in the dual (D) since y i ≥ y j + 1 implies y i y j ≥ 1 . So it is a feasible solution of (D). (And vice versa.) (g) If there is a topological ordering then by (f), (D) is feasible. Its objective function is 0. So by the Weak Duality theorem, any feasible solution of (P) is at most 0. So (P) is not unbounded. But if there is a directed cycle then (P) is unbounded by (d). So there is no directed cycle in the digraph. (h) If (P) has a feasible solution of value greater than 0, then we can choose any arc e = ij with x e > , and by the constraint for vertex j in (P), we see that x e 1 > for some arc e 1 of the form ji 1 . Then similarly, x e 2 > for some arc of the form i 1 i 2 , and so on. Eventually the we must reach a vertex already seen, and complete a cycle of ~ G . So ~ G has a directed cycle....
View
Full
Document
This note was uploaded on 06/12/2011 for the course CO 250 taught by Professor Guenin during the Spring '10 term at Waterloo.
 Spring '10
 GUENIN

Click to edit the document details