Question

6. [-14 Points] DETAILS TANAPMATH6 6.3.028. Solve the linear programming problem by the method of corners. Find the minimum and maximum of P = 7x + 3y subject to 3x + 5y = 20 3x + -2x + y s 3 x 0, y 20. y s 16 The minimum is P = at (x, y) = ( The maximum is P = at (x, y) = Need Help? Read It Watch It Talk to a Tutor

Answer 1

10. Given that, P = 7HIBY subject 3 utsy > 20 3xty & 16 -24 + y <3 217, 0, y lo consider the constraints of equality 33+5y = 20 re 0 S 3 4 3x + y :16 4 5 4 1 y - 2ndt y = 3 0 3 - h now we draw the graph fox feasible region.

Date Page But5y=20 -220+ y=h Buty 16 मा A -- 2 3 S 6 Here sheded region shows feasible region. corner points - A = (5:1) Ore ABC For B solve 3 x ty=16 -24 ty=3 30 +y = 16 +82 043 بلاگ =) H=13 = 2.6 1 2 363) +y = 16 Y = 16-3979 y = rag c 11 -66 67 9 B: (2.6.11.6661)

for a , solve -21+4=3 324+20 => 6M + 3y=9 + Ghet 101=40 3y = 49 Y=49 = 3.7692 13 -2x +3.7692=3 -24-3-3.7092 -2013 -0.7692 x=0.3846 C: (0-3846, 3.7692) :: PLA) = Plesos = 7/5)+3(1) -35+3 -- 38 P18) = P1121641168673 + 7 (2.6) +3(11-6667) 18.2+ 35.000/ 2 53.2001 f PCC) -P/10.384623.7092) = 7(0-3846) + 3(3.7692) 22.6927+ 11.3076 = 13.9998 . The minimum is p=113.99 ie 14 otheads Ot (wy)-60-3846,3.7692) maximum is p-153:20) at (2014) - |( 206, 11.6667 11 TY