Question: 1. Make up your own linear programming problem involving the constrained maximization of an objective function with two variables and at least two constraints, and solve it.
2. Find the minimum value of the function C = 40A+20B subject to the constraints
10A + 40B ≥ 40 (x)
30A + 20B ≥ 60 (y)
10A ≥ 10 (z)
A ≥ 0, B ≥ 0
Will there be slack in any of the constraints at the optimum combination of A and B? If so, what is the excess capacity?