Question

Case Study
The simplex table for a maximization problem of linear programming is given below:
Basic
C
5
0
Solution
b.
10
3
C
X; -
4
XI
1
X2
S2
5
X2
1
0
5
0
Si
1
-1
5
-5
0
S2
0
1
0
z
(Cj-Z)
1
5
-1
0
Answer the following question, giving reasons.
1. Is this solution optimal?
2. Are there more than one optimal solution?
3. Is this solution degenerate?
4. Is this solution feasible
5. How many units of xi and X2 are produced according to this solution and what is the
total profit?
6. How much would you be prepared to pay for another hour or capacity each on
machine A and machine B​

Answer 1

पद के प्रकार कौन-कौन से है?

अ) सर्वनाम

ब) क्रिया

स) संज्ञा

द) सभी