FundamentalsWe start by looking at the kinds of problems we will be solving:
|The graph on the right shows the feasible region for the following LP problem:||
Enter coordinates as they are normally written, eg.(2,-3)
Unbounded feasible setsNow solve the example above left:
%A In %4 you will find a discussion of easy method to determine whether there are optimal solutions in the case of an unbounded feasible region:
- Draw a (large) rectangle that includes all the corner points of the feasible region, and compute the values of the objective at the new corner points introduced by the rectangle. If the optimal value is still at one of the original vertices then the LP problem has an optimal solution; otherwise, it does not.
Now try the exercises in %4, some the %8, or move ahead to the next tutorial by pressing "Next tutorial" on the sidebar.