80 likes | 180 Views
Section 3-4. Linear Programming. Solving for Minimums or Maximums with constraints . Graph the inequalities(CONSTRAINTS) & shade Identify the overlapping region Identify the corners of the region Test the corners to identify the max or min. Maximums & Minimums.
E N D
Section 3-4 Linear Programming
Solving for Minimums or Maximums with constraints • Graph the inequalities(CONSTRAINTS) & shade • Identify the overlapping region • Identify the corners of the region • Test the corners to identify the max or min
Maximums & Minimums • If a maximum or minimum exists, they will occur at a corner point.
Example • Given: • Find the point (x,y) that Minimizes C=5x+3y
Example • Given: • Find the point (x,y) that Maximizes P=3x+2y
Example Constraints:
Example Constraints: MAXIMIZE PROFIT: P=60x+40y
Example Constraints: MINIMIZE COST: