UGC NET CSE | June 2019 | Part 2 | Question: 10

Question

Consider an LPP given as

$\text{Max } Z=2x_1-x_2+2x_3$

subject to the constraints

$$2x_1+x_2 \leq 10 \\ x_1+2x_2-2x_3 \leq 20 \\ x_1 + 2x_3 \leq 5 \\ x_1, \: x_2 \: x_3 \geq 0 $$ What shall be the solution of the LLP after applying first iteration of the Simplex Method?

• A. $x_1 = \frac{5}{2},\: x_2=0, \: x_3=0, \: Z=5$
• B. $x_1 = 0, x_2=0, \: x_3=\frac{5}{2}, \: Z=5$
• C. $x_1 = 0, x_2=\frac{5}{2}, \: x_3=0, \: Z=-\frac{5}{2}$
• D. $x_1 = 0, x_2=0, \: x_3=10, \: Z=20$

Answer 1

Option B

x1=0, x2=0, x3=5/2, z=5

Comments

Please explain ma'am

Answer 2

 

For theory understanding go to ... http://www.phpsimplex.com/en/

...................

 

 

 

...................

 

....................

 

 

................