a5 - C O350 L INEAR P ROGRAMMING A SSIGNMENT 5 Due Date...

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

View Full Document Right Arrow Icon
CO350 LINEAR PROGRAMMING - ASSIGNMENT 5 Due Date: Friday June 18 at 2 PM in assignment drop box 2, in front of MC4066. Please make sure that your name and student number, the course number, and the name of your instructor are clearly written on the front of your assignment, and that all 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. Exercise 1. Prove that if x j is the leaving variable during one iteration of the simplex method then x j cannot be the entering variable at the next iteration. Exercise 2. Consider the linear program max { c T x : Ax = b,x 0 } where A = " 2 1 1 0 0 1 0 1 # , b = " 6 2 # , and c = [3 , 1 , 1 , 1] T . Solve this linear program using the revised simplex method, starting with the feasible basic solution x * = (0 , 2 , 4 , 0) T . If the problem has an optimal solution, provide one. If the problem is unbounded, provide a parametric set of feasible solutions
Background image of page 1

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

View Full Document Right Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 2

a5 - C O350 L INEAR P ROGRAMMING A SSIGNMENT 5 Due Date...

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