CORNER POINT METHOD
1.
Graph your feasible set. Determine your corner points.
2.
Calculate the coordinates of your corner points by setting up systems of equations with your
boundary lines to see where the boundary lines intersect.
3.
Plug in the (x, y) coordinates of
each
of the corner points into your objective function and see
which value is the greatest (or smallest). The corner point where the minimum or maximum
value is achieved is the point that optimizes your objective function.
EXAMPLE:
If we had the feasible set below, for example, we would have 4 corner points. We would
need to solve for these 4 corner points and then plug each of their coordinates into our objective
function to see which one optimizes the function.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentSWEEPING OBJECTIVE LINE METHOD
1.
Graph the feasible set.
2.
Suppose you are given an objective function, Ax+By . Draw a dotted objective line that is of the
form Ax+By = c. You can pick any “c” you want, but it is most convenient to pick the number that
is the least common multiple of A and B.
This is the end of the preview.
Sign up
to
access the rest of the document.
 Fall '10
 Beaulieu
 Linear Programming, Systems Of Equations, Equations, Probability, Optimization, objective function, red line, corner point, objective line

Click to edit the document details