solutions - UNIVERSITY OF WATERLOO MIDTERM EXAMINATION...

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

View Full Document Right Arrow Icon
UNIVERSITY OF WATERLOO MIDTERM EXAMINATION SUMMER TERM 2007 Surname: First Name: Signature: Id.#: Section#: Course Number CO350 Course Title Linear Optimization Instructors J. Geelen, B. Guenin Date of Exam June 13th, 2007 Time Period 7:00 PM - 8:50 PM (1 hour and 50 minutes). Number of Exam Pages (including cover page) 9 pages Exam Type Closed Book Additional Materials Allowed none Problem Value Mark Awarded 1 20 2 20 3 20 4 20 5 20 Total 100
Background image of page 1

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

View Full DocumentRight Arrow Icon
Question 1 (20 marks) . Simplex Consider the following linear program: max [1 , 3 , 0 , 2 , 0] T x subject to " 1 2 1 3 0 1 1 0 1 1 # x = " 10 4 # x 0 Note that B = { 3 , 5 } is a feasible basis. Solve this linear program using the simplex algorithm starting with the basis B . If you have more than one choice for the entering variable, choose the entering variable with the smallest index (for instance if at some iteration x 1 and x 4 could both enter the basis, you would choose x 1 ). Important:
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/19/2010 for the course MATH co 350 taught by Professor Cheriyan during the Spring '09 term at Waterloo.

Page1 / 7

solutions - UNIVERSITY OF WATERLOO MIDTERM EXAMINATION...

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

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