Question

1. (-/18 Points] DETAILS HARMATHAP11 4.3.003.MI. Set up the simplex matrix used to solve the linear programming problem. Assume all variables are nonnegative. Maximize fx + y subject to 2x + 7y S 100 x + 3y S 225. x 5 32 first constraint second constraint objective function Need Help? Read It Watch Master it

Answer 1

Given upp is manimize f = 7a+gy subject to, 20+ 7y - 100 2+84 225 ayyo since, all of the constraints are of 's type. 80 Qe introduced Slack Varialdes SLSz to the 1st and 2nd cons troints respectively we have - subject to 2+8y +52 = 220 muiximize f = 72+gy się f-fa-gy=0 ay, SuS270 2x+fy +Si=100

initial simplex tableau: 2 As S, Sz o f 10/100 first constraints 01225 and constaints O objective function 18 O EZ -9 0 0 Given LPP is manimize f = 38+77 Subject to, 4x+3y=800 xtoy € 325 ny ro since, all of the constraints are of t type, so de introduced slack variables Susz to the 1st and and constraints respectively we have subject to 4x+3y +5,- 800 xt64 S2 = 325 maximize I = 3x+74 ie f-30-7y=0 Initial simplex tableau; 2.9, S., Seo 2 as 4 si S₂ f 31 0 0 0 1800) ast constraints 16 o DA (325) and constreants 10 0 objective function