Explore BrainMass

Solving a linear programming problem graphically

MIN z= 5x1 +2x2

st 2x1 +5x2>or equal to 10
4x1-x2>or equal to 12
x1 + x2 > or equal to 4
x1, x2 > or equal to 0

A Solve graphically for the optimal solution.
B How does one know that although x1=5, x2=3 is a feasible solution for the constraints, it will never be the optimal solution no matter what objective function is imposed?

© BrainMass Inc. brainmass.com August 17, 2018, 5:06 am ad1c9bdddf

Solution Summary

The process of solving a linear programming problem graphically is explained and illustrated by an example.
The solution is in a PDF file.