Question: The following is an optimal simplex tableau for a maximization problem having all ? constraints: a. Give the optimal solution. b. Give the optimal dual
The following is an optimal simplex tableau for a maximization problem having all ? constraints:

a. Give the optimal solution.
b. Give the optimal dual solution.
c. Find ?z / ?b 1 Interpret this number.
d. Find ?x 1 / ?b 6 Interpret this number.
N X1 x3 x5 N 1 0 0 0 X1 0 1 0 0 x2 0 1 0 -2 X3 0 0 1 0 X4 SLACKS x5 3 x6 0 5 2 0 1 1 0 -1 1 4 3 RHS 0 2 221 2
Step by Step Solution
3.37 Rating (153 Votes )
There are 3 Steps involved in it
To solve this problem lets go through each part step by step a Give the optimal ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (2 attachments)
6090246c57b16_21512.pdf
180 KBs PDF File
6090246c57b16_21512.docx
120 KBs Word File
