7. Finding Feasible Regions
Find the system
whose feasible region
is a triangle with
vertices (2,4),
(-4,0), and (2,-1)
2
46
832
x
yx
yx
8. Linear Programming
Businesses use linear
programming to find out how to
maximize profit or minimize
costs. Most have constraints on
what they can use or buy.
9. Linear Programming
The Objective Function is
what we need to maximize or
minimize. For us, this will be a
function of 2 variables, f(x, y)
12. The general idea… (pg 398)
Find max/min values of the objective
function, subject to the constraints.
yxyxf 52),(
0,0
1
842
623
yx
yx
yx
yx
Objective Function Constraints
14. The general idea… (pg 398)
The Feasible Region makes up the possible
inputs to the Objective Function
yxyxf 52),(
15. Corner Point Thm (pg 400)
If a feasible region is
bounded, then the
objective function
has both a
maximum and
minimum value,
with each occurring
at one or more
corner points.
16. Find the minimum and maximum
value of the function f(x, y) = 3x - 2y.
We are given the constraints:
• y ≥ 2
• 1 ≤ x ≤5
• y ≤ x + 3
19. • The vertices (corners) of the
feasible region are:
(1, 2) (1, 4) (5, 2) (5, 8)
• Plug these points into the
function f(x, y) = 3x - 2y
Note: plug in BOTH x, and y values.