Steps to Solve a Linear Programming Problem
1Choose the unknowns.
2Write the objective function.
4 Find the set of feasible solutions that graphically represent the constraints.
5 Calculate the coordinates of the vertices from the compound of feasible solutions.
6 Calculate the value of the objective function at each of the vertices to determine which of them has the maximum or minimum values. It must be taken into account the possible non-existence of a solution if the compound is not bounded.