SWE 3CO3: Assignment 6.

Tam as Terlaky March 26, 2004 Please respect the guidelines as expressed at: http://www.cas.mcmaster.ca/~se3c03/ Your solutions must reach your instructor or your TA by Monday, April 5, not later than 12:30 pm. You, or your reliable friend must give your work to your TA hand-to-hand. You have to sign your assignment on the front page. Your signature certies that the assignment is YOUR work. Send your code to the course e-mail account.

1 Consider the following IP: min 2x1 5x2 s.t. 3x1 + 2x2 2 x1 + 4.1x2 4.1 x1 , x2 0 x1 , x2 are integers. a) Solve the IP by using the Branch and Bound algorithm. Use MATLAB to solve the continuous subproblems. b) Solve the IP by using the MIP feature of XPRESS-MP. c) Compare the results obtained at a) and b). 2. Consider the following TSP: X 25 13 44 35 43 X 60 38 59 54 36 X 39 10 45 65 58 X 33 36 67 48 29 X

a) Solve the TSP by using the Branch and Bound algorithm. b) Solve the TSP by using XPRESS-MP when you use the cut-set constraints. c) Compare the results obtained at a) and b). 3. Consider the Node Coloring Problem as described in Exercise 11.14 on page 456 of your book. Design a GA (Genetic Algorithm) heuristics to solve the Node Coloring Problem. You do not have to solve any problem, but you need to describe all important ingredients of your algorithm specialized to the Node Coloring Problem. SEE NEXT PAGE FOR QUESTION #4

4. You have 9 days to prepare for four exams: 3E03, 3K04, 3I03, 3C03. At least one and at most ve day will be spent on each subject. Each day you are working only on one course, thus you can spent 1, 2, 3, 4 or 5 days on each courses. The longer you study a subject, the better is your grade. The grades as a function of the number of study days is given in the following table. Expected grade % Courses 3E03 3K04 3I03 3C03 40 45 50 60 50 65 65 75 60 80 85 85 80 95 90 95 90 100 95 100

Number of days 1 2 3 4 5

You want to maximize the product of your grades by using the available time optimally. Solve the exam problem by using Dynamic Programming. Formulate the Optimality Principle and the recursion as well. Give the optimal value and the optimal study plan.

You can pick-up your corrected assignment April 12, Monday afternoon 15.00-16.00 in the lobby of ITB 102!. 2