Class Notes (835,759)
Canada (509,376)
Business (3,286)
BU385 (50)


4 Pages
Unlock Document

Barry Mc Clinchey

CO250 I NTRODUCTION TO O PTIMIZATION – HW 4 Due Date: Friday, February 3, by 2PM, in the drop box outside the Tutorial Centre. LATE ASSIGNMENTS WILL NOT BE GRADED . Important information: While it is acceptable to discuss the course material and the assignments, you are expected to do the assignments on your own. Copying or paraphrasing a solution from some fellow student or old solutions from previous offerings of related courses qualifies as cheating. For more details review the official university guidelines at policy.shtml. We will instruct the TAs to actively look for suspicious similarities and evidence of academic offenses when grad- ing. All academic offenses are reported to the Associate Dean for Undergraduate Studies and are recorded in the student’s file, see for information about penalties. If you have complaints about the marking of assignments, then you should first check your solutions against the posted solutions. After that if you see any marking error, then you should return your assignment paper to the drop box within one week and with written notes on all the marking errors; please write the notes on a new sheet and attach it to your assignment paper. It will be returned in class. If you still have concerns after this, then contact your instructor. You may ask question about assignments on the discussion board available on the course webpage. We also provide tutorials and office hours, for more information consult the syllabus. Please USE THE COVER SHEET that is available at the end of the assignment. It is imperative that you indicate your full name and student ID (as we have many students with the same last name). Failure to use the cover sheet will result in a 5% deduction on the assignment mark. Exercise 1 (25 marks). Consider the LP problem maximize z = c x subject to Ax = b, x ≥ 0, where      1 2 −2 0   2  A = , b = 0 1 3 1 5 ▯ ▯T c = 0, 3, 1, 0 . (a) Beginning with the basis B = {1,4}, solve the problem with the simplex method. At each step choose the entering variable by the smallest-subscript rule. (b) Give a certificate of optimality or unboundedness for the the problem, and verify it. 1 2 Exercise 2 (20 marks). Consider the LP problem maximize z = c x subject to Ax = b, x ≥ 0, where    9  2 5 1 0 3 1 4     A =  0 2 2 −4 2 −4 , b = 0  3 5 1 2 6 3 4 ▯ ▯T c = 2, −4, 1, 4, 8, 4 Let B = {1,3,4}. You are given that   1 2 − 2 −1 A−1 =   . B  −3 1 2  3 1 − 2 4 1 (a) Find the basic solˆ determined by B, and the canonical form of the problem corresponding to B. Iˆ feasible? (b) App
More Less

Related notes for BU385

Log In


Join OneClass

Access over 10 million pages of study
documents for 1.3 million courses.

Sign up

Join to view


By registering, I agree to the Terms and Privacy Policies
Already have an account?
Just a few more details

So we can recommend you notes for your school.

Reset Password

Please enter below the email address you registered with and we will send you a link to reset your password.

Add your courses

Get notes from the top students in your class.