(A) Using slack variables, determine the initial system for the linear programming problem. (B) Write the simplex tableau and identify the first pivot and the entering and exiting variables. (C) Use the simplex method to solve the problem. P = 16x, + 12x2 2x1 + X2 58 X1 + 8x2 58 X1, X2 2 0 Maximize subject to

please answer in a digital response so I may fill in the blanks, thank you in advance!

Snack A provides 10 grams of protein and costs 2 dollars, snack B provides 6 grams of protein and costs 3 dollars.  You need at least 30 grams of protein a day.  Let x be the number of snack A you buy and y be the number of snack B you buy.  You want to minimize cost. State the linear programming problem in mathematical terms, identifying the objective function and constraints.   Do not solve the problem to completion.  Just state the inequalities needed and the objective function.

Use the simplex method to solve the linear programming problem. Z = X₁ +4x₂ + x3 + 5x4 X₁ + 8x₂ + 5x₁ + x₂ + x₁20, X₂20, X3 20, x4 20 80 F3 Maximize subject to 4 Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice. OA. The maximum is OB. There is no maximum. View an example Get more help. 22 श्री R F % 5 t x3 + x4≤10 3x3 + x4 ≤200 G 6 when x₁ = Y H & 7 x₂ = U X3 = * 8 ▶II X4 = · ( 9 K S₁ = and $₂ =. Clear all O 0 L F10 P Check answer 4) + ||