FUnfortunately we can get the graphical solution of the LP problem only for problems with 2 and 3 decision variables
FTherefore we need to find an alternative method to get the optimal solution of LP problems
FSome observations:
*We know that the optimal solution must be in a corner point (why?)
*We also know that a corner point is defined by the intersection of two constraints (for the 2 decision variable case we solve a different subset of two linear equations for each corner point). What about when we have three or more decision variables? Can you identify all the corner points?
*So what we could do is solve the subsets of linear equations corresponding to all the corner points. Then we evaluate the objective function at those corner points and the one yielding the best objective value is our optimal solution.
*However, since there is a large number of corner points (how many?) this is impractical. We need a smart way to search for the optimal solution. This is what the the simplex algorithm does for us.
F