The _______ is the equation that can be minimized or maximized in linear programming.
objective function
The minimum or maximum of an objective function will occur at a __________ of the feasible region
vertex
Joe makes ice cream. Each gal of Oreo uses 2 c of milk and 2 eggs. Each gal of fudge takes 3 c of milk and 1 egg. He makes $3 on each gal of oreo and $2 on each gal of fudge. He has 18 c of milk and 10 eggs. What is Joe's max profit?
$17
Solve:
y=x+6
y=-2x-3
(-3,3)
Solve:
y=5x-7-3x
-2y=-12
(2,3)
You raise/train cats and dogs. Each cat eats 2 lbs of food and trains 2 hrs. Each dog eats 6 lbs of food and trains 1 hr. They have 30 lbs of food and 10 hrs to train. Cats sell for $200 and dogs sell for $150. Objective function of profit?
P=200c+150d
Name two methods of solving systems of two equations.
(2) Substitution, Elimination, Graphing
Solve:
y=-4x+8
8x+2y=16
infinitely many solutions
Solve:
2y=x-6
-2x+4y=8
no solution
Bob has 15 bills in his wallet that total $145. He has a mix of $5 bills, $10 bills, and $20 bills. The number of $10 bills is one less than twice the number of $20 bills. How many of each type of bill does Bob have in his wallet?
7 - $5 bills
5 - $10 bills
3 - $20 bills
Your experience on this site will be improved by allowing cookies.