Consider the following minimization problem.
Min z = 1.5x1 + 2x2
s.t. x1 + x2 300
2x1 + x2 400
2x1 + 5x2 750
x1, x2 0
What are the optimal values of x1, x2, and z?
This solution provides details on how to solve a minimization problem for a linear programming situation.