Explore BrainMass

solving a linear programming problem

Consider the following linear programming problem.
MIN Z = 10x1 + 20x2
Subject to: x1 + x2 >= 12
2x1 + 5x2 >= 40
x1, x2 >= 0
What is minimum cost Z=??
Put your answer in the xxx.x (to one decimal place)

Solution Preview

Solution. Use simplex method, we obtain the following.

Optimal Solution: z = 173.333; x1 = 6.66667, x2 = 5.33333

So, the optimal profit is ...

Solution Summary

This solution contains a detailed explanation of solving a linear programming problem.