math quiz

Answer: Yes, the given simplex tableau is in final form, and the solution of the LPP is option (C)
    
Answer: The given simplex tableau is not in final form, and the pivot element to be iteration is option (A)
    
Answer: Yes, the given simplex tableau is in final form, and the solution of the LPP is option (D)
    
Answer: The given simplex tableau is not in final form, and the pivot element to be iteration is option (C)
    
Answer: The given simplex tableau is not in final form, and the pivot element to be iteration is option (A)
    
Answer: The given simplex tableau is not in final form, and the pivot element to be iteration is option (C)
    

Answer: Yes, the given simplex tableau is in final form, and the solution of the LPP is option (C)
    
To solve the above LPP convert the inequality constraints to equations by introducing the non negative Slack variables u and v. The Coefficients of Slack variables in the objective function are taken zero.
Therefore the given LPP now becomes
Maximum Z =
6700
xyuv
+++
 Subject to the constraints
04,
205
xyuv
xyuv
+++=
+++=
And
,,,0
xyuv
³
Present the constraints in matrix form
11104
21015
x
y
u
v
éù
êú
éùéù
êú
=
êúêú
êú
ëûëû
êú
ëû
Initial Simplex Table
Cj
®
6 7 0 0
Basic Variable
CB XB
x y u v
Min Ratio
¬
u
v
0 4
0 5
1 1 1 0
2 1 0 1
4/1
¬
5/1

j
D®
-6 -7
­
0
¯
0
y
v
7 4
0 1
1 1 1 0
1 0 -1 1

j
D®
1 0 7 0
Answer: Since all
j
D
are positive so simplex tableau is in final form, and the solution of the LPP is option (A)
    
Same as question 8 and after solving the final form of simplex tableau is
Cj
®
2 3 0 0 0
Basic Variable
CB XB
x y u v w
Min Ratio
u
y
x
0 2
3 4
2 4
0 0 1 -1/3 -1/3 0 1 0 2/3 -1/3
1 0 0 -1/3 2/3

j
D®
0 0 0 4/3 1/3
Answer: Since all
j
D
are positive so simplex tableau is in...