Consider the following linear programming problem
| Maximize | $1 X1 + $2 X2 | |
| | |
| Subject To | 2 X1 + X2 ? 8 | Constraint A |
| X1 + X2 ? 5 | Constraint B |
| X1, X2 ? 0 | Constraint C |
Note: Report two digits after the decimal point. Do NOTuse thousands-separators (,)
1 - Which of the following is the correct standard maximizationform for the above linear programming problem
AnswerCorrectNot Correct | AnswerCorrectNot Correct | AnswerCorrectNot Correct | AnswerCorrectNot Correct |
Z -X1 - 2 X2 = 0 2 X1 + X2 ? 8 X1 + X2 ? 5 X1, X2 ? 0 | Z - X1 - 2 X2 - 0 S1 - 0 S2 = 0 2 X1 + X2 + S1 + 0 S2 = 8 X1 + X2 + 0 S1 + S2 = 5 X1, X2, S1, S2 ? 0 | Z - X1 - 2 X2 = 0 2 X1 + X2 + S1 = 8 X1 + X2 + S2 = 5 X1, X2, S1, S2 ? 0 | Z - X1 - 2 X2 - S1 - S2 = 0 2 X1 + X2 = 8 X1 + X2 = 5 X1, X2, S1, S2 ? 0 |
2- Fill out the following blanks with Final Simplex Tableauinformation
Basic Variables | X1 | X2 | S1 | S2 | Z | Right Hand Side |
AnswerX1X2S1S2 | Answer | Answer | Answer | Answer | Answer | Answer |
AnswerX1X2S1S2 | Answer | Answer | Answer | Answer | Answer | Answer |
P | Answer | Answer | Answer | Answer | Answer | Answer |
3- The optimal is
Z = Answer
When
X1 = Answer
X2 = Answer
