Question

Use the simplex method to solve the linear programming problem.	Maximize	z= 7x1 + 2x2 + x3
	subject​ to:	x1 + 4x2 + 8x3 ≤ 113
		x1 + 2x2 + 10x3 ≤ 209
	with	x1 ≥​ 0, x2 ≥ ​0, x3 ≥ 0.

Select the correct choice below​ and, if​ necessary, fill in the answer boxes to complete your choice.

A.The maximum is ___ when x1 = ___​, x2 =___, and x3 = ___.

​(Simplify your​ answers.)

B.There is no maximum.

Answer 1

6fiven that, Maxtmiae 2 x+22t X3 Sukfected to 81 ラEx8+Txh +'x 2X21073209 X, X2,X30 2 Xt2X2+ X3 + 0.S,+ 0.52 Subjected to Xtutex3+ 113 Xt 272t 10x3 ,= 209 X1,/X2,X3, S,, 0 Simplex Table 1 $4 O O 2 Solutionatio X3 S1 Basic Value X2 X1 113 4 209 10 2 1 CG-2i Colution ECRX C Ratio Basie Value O C T O

At c- O Dy Maximiratlon Case Consic Positee Values ,2 2 l70) SIT A 8 celeatieny Co now, max min of Ratio key column 2 Aound up the We and theue by puepare Cteatin Table noLD Heue, utesection the sow & Cslum Koy element 1e Valfable s X1 & Entefng leaving Valiable f S Ore sation Tale ( o Ratio 3 X1 B.V S2 4 X, 113 -1 96 O91 56 G-4 26-55 - CorY Kay umn XGon ky Row New Walue old Value Kiy lemeut

Knteng vasfable (x,) values ase ealeulated baled on folmula ofleastng Valiable (S) Kay Element C1) Calaulations fo S -L1 = 1-1 = 0 2-IX4 2-4 2-2 17 10-1x8 io-82 6-18 1 - (x0 (-0 00 209 113 209-1X13 96 1 Maxin atlan ale (- (eems t Saticfied Tn Gteatio So, the feasble Cautblon fe S2=0 2 Copt)=91