a9 - CO350Linear Optimization Assignment 9 This assignment...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CO350Linear Optimization Assignment 9 This assignment is due Friday, July 23, 2010, at 2 pm, in assignment drop box #2, in front of MC4066. Please make sure that your full name, your student ID number, the course number, and the name of your instructor are clearly visible on the front of your submission, and that all your pages are securely stapled. You may discuss the assignment questions with other students, but you must write your solutions up independently, and all submitted work must be your own. 1. Consider the following optimal tableau for the LP relaxation of an integer linear program. For each constraint row, find the corresponding Gomory cutting plane inequality, then write it in a form that can be added to the tableau. z + 1 14 x 4 + 3 14 x 5 + 5 4 x 6 = 27 4 x 1- x 5- 5 4 x 6 = 9 4 x 2 + 1 2 x 4- 1 2 x 5 + 17 4 x 6 = 13 4 x 3- 3 7 x 4 + 5 7 x 5 + 3 x 6 = 1 7 2. Solve the following integer linear program using the cutting plane algorithm, starting from the optimal basis {...
View Full Document

Page1 / 2

a9 - CO350Linear Optimization Assignment 9 This assignment...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online