2-5 Linear Programming

Steps to finding the maximum profit

1. Identify your variables, state the constraints, write your objective function 2. Graph the inequalities in calculator or Desmos.com 3. Identify the vertices of the feasible region 4. Substitute all vertices into the objective function 5. Find th maximum profit/cost

Objective function equation

2x+y=C

Linear programming

Method for finding the max/min values of some quantity given a system of constraints

Objective function

Function of 2 variables (x & y) that is the objective to maximize (or minimize) such profits or costs

Constraint

Inequalities that limit possible solutions

Vertices

Intersections of inequalities; testing points fo rate objective function

Feasible region

Shaded region created by the intersection of all inequalities

Constraints

x+y >/= 6 x-y >/= 4 x >/= 0 y >/= 0