problem 2.

Part a: Create a .mod file for the LP (linear programming) below:

min 21 + 32

s.t. 1 2 1 + 1 4 2 4

1 + 32 36

1 + 2 = 10 1,

2 0

Part b: Initiate an AMPL session. Import and solve the model you created using AMPL/CPLEX.

Part c: Using the output from part b, determine whether the model resulted in an optimal solution, unboundedness, or infeasibility. If the model has an optimal solution, display (in the same AMPL session) the optimal objective function value, the obtained optimal solution, and each constraints slack at the obtained optimal solution.