207 20 win 5x, + 312 - 2x3 - 8x4 subject to 2320 Bri + 2 + Ara = 10 + 524 = 12 Problem 2.1 In Python use Pyomo to solve this linear program. Use sol 2 1. ipynb as your template. (a) Begin constructing your Pyomo model by specifying the number of decision variables (b) Add an objective to your model by defining your cost function coefficients. (c) Finish the definitions of the lower and upper bound constraints. (d) Define the A matrix, b vector, and number of equality constraints. (c) Define the A matrix, b vector, and number of inequality constraints. (f) Report the optimal cost(J*) and optimal x(z*) in the result dictionary. (g) Use the print out of dual values to answer the next problem. Problem 2.2 (a) From your solution in 2.1, which constraints are active? Explain using the dual values found. (b) Which constraint is the objective function most sensitive to. Explain using the dual values found- (c) Suppose we change the first inequality constraint to stay + 23 5 4.1 and the first equality constraint to ken + 22 + 424 = 9.8 Using dual values find an estimate to the new value of the