2 votes 2 votes 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? $x_1 = \frac{5}{2},\: x_2=0, \: x_3=0, \: Z=5$ $x_1 = 0, x_2=0, \: x_3=\frac{5}{2}, \: Z=5$ $x_1 = 0, x_2=\frac{5}{2}, \: x_3=0, \: Z=-\frac{5}{2}$ $x_1 = 0, x_2=0, \: x_3=10, \: Z=20$ Numerical Methods ugcnetcse-june2019-paper2 simplex-method + – Arjun asked Jul 2, 2019 • retagged May 22, 2020 by soujanyareddy13 Arjun 2.9k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Option B x1=0, x2=0, x3=5/2, z=5 Roma_nagpal answered Oct 26, 2019 Roma_nagpal comment Share Follow See 1 comment See all 1 1 comment reply jjesla commented Dec 3, 2019 reply Follow Share Please explain ma'am 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes For theory understanding go to ... http://www.phpsimplex.com/en/ ................... ................... .................... ................ Tiklu_95 answered Jun 8, 2020 Tiklu_95 comment Share Follow See all 0 reply Please log in or register to add a comment.