Friday: - Linear Programming - Exercises - Quiz
Friday: - Linear Programming - Exercises - Quiz
• Linear Programming
• Exercises
• Quiz
Linear Programming
• Objective: Maximize or minimize the value, given a set of
constraints
• Objective Function – the quantity to be optimized
• The optimal solution(s) must occur at one of the corner
points of the solution region or feasible region
*Investment Application: what are the optimal solutions?
how do we determine optimal or maximized values?
• Arrange given variables and values in a table
• determine your objective function.
• Form the inequalities given the constraints.
• Plot them and solve for the vertices of the overlapping region.
• Substitute the vertices to the objective function and determine
which vertex gives the highest value.
Example 4, Page 332
Investment Application 𝐵 + 𝐶 ≤ 30
𝐶 ≥ 10
• Invest up to $30,000
𝐶 ≤ 30
• Bonds or B at 9%
𝐵 ≤ 15
• MMC or C at 5%
𝐵≥0
• Invest no more than $15,000 in B
𝐶≥0
• Invest at least $10,000 in C
B
Let us look at Example 7, page 335
What is the Objective – or that which we need to Maximize or
minimize?
PROFIT
What is the Objective function?
P(r,d) = $3 r + $4 d
We are able to form 2 inequalities given the constraints.
We plot them, then determine the vertices.
To get optimized profit, we substitute the vertices to the
objective function.
So again how do we determine optimal or maximized
values?
• Arrange given variables and values in a table and determine your
objective function.
• Form the inequalities given the constraints.
• Plot them and solve for the vertices of the overlapping region.
• Substitute the vertices to the objective function and determine
which vertex gives the highest value.
Game Question:
#55, page 340
Corn (x) Soybean (y) Constraints
profit 900/acre 800/acre -
area x y 500 acres
Hours to 3hrs/acre 2hrs/acre 1300 hours
plant