Linear Programming Illustrated

Linear Programming Illustrated - CORNER POINT METHOD 1....

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
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.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
SWEEPING 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.
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 3

Linear Programming Illustrated - CORNER POINT METHOD 1....

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online