CEE111_Quiz2_W10_Solution_Grading_Revised

CEE111_Quiz2_W10_Solution_Grading_Revised - Name_ Student...

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

View Full Document Right Arrow Icon
Name________________________________ Student Number ____________________ CEE 111 Winter 2010 Quiz 2 Solution Consider the following linear programming problem: Minimize 123 4 325 Z xxx x  subject to: 12 4 12 34 3 4 1234 351 0 42 2 4 33 6 22 4 5 32 2 8 ,,, 0 xx x xx x x xxxx        Display an initial feasible solution to this problem in the form of a SIMPLEX TABLEAU. Be sure that, in the Tableau, the basic variables are clearly identified as having only one non-zero element in the column associated with its coefficients. Step1. Convert equality constraint 4 above to two equivalent inequality constraints: 3 4 4 3 3 4 0 2 4 6 4 5 4 5 2 8 0 x x  Grading: Total of 10 Points 2 Points
Background image of page 1

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

View Full DocumentRight Arrow Icon
Name________________________________ Student Number ____________________ Step 2. Add appropriate slack variables to convert inequalities to equalities: Minimize 123 4 123456 00 5 3 0 2 0 Zxx x SSSSSS x   subject to: 12 4 12 34 3 1 4 1 2 3 4 5 6 1 234 23456 35 1 0 42 2 4 33 6 22 4 5 4 5 32 2 8 ,,,,,,,,, 0 xx x S S S S S S xx x S xxx x xxxx SSSSS  
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.

Page1 / 3

CEE111_Quiz2_W10_Solution_Grading_Revised - Name_ Student...

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