Scribd
Upload
77 views

Notes 3.4-Linear Programming

Algebra 2 notes

Uploaded by

c7wck92njg
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
77 views

Notes 3.4-Linear Programming

Algebra 2 notes

Uploaded by

c7wck92njg
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Lesson 4: Linear Programming

_________________________ – the inequalities limiting the problem at hand.

____________________________________________ – a method for finding a minimum


or maximum value of some quantity, given a set of constraints.
Vocabulary

_____________________________________ − the shaded polygonal area created


by the intersection of the graphs of inequalities. It is the location where every
constraint is met or satisfied.

_______________________________________ − a function in two variables f(x,y) that


is the objective to maximize or minimize, such as profit, etc.

_____________________________ − a function where no maximum value exists.


The shaded regions of the constraints do not form a closed figure.

Property – Vertex Principle of Linear Programming

If there is a maximum or a minimum value of the linear objective function,


it occurs at one or more vertices of the feasible region.

Sketching a Feasible Region

1. Graph each inequality on a coordinate axes system.


2. Find the feasible region by shading correctly.
3. Determine the vertices of the feasible region (polygon) that are formed.
4. Evaluate each coordinate in the objective quantity.
5. Determine the maximum (highest value) and the minimum (lowest value)
by using substitution.

EX #1: Sketch the feasible region.

𝑥𝑥 ≥ 3
𝑦𝑦 ≥ 2
𝑦𝑦 ≤ 7
𝑥𝑥 + 𝑦𝑦 ≤ 10

© 2022 Jean Adams Flamingo Math.com


Testing Vertices

You can solve a problem using linear programming by testing all the vertices of the
feasible region in the objective function.

EX #2: Constraints:
𝑥𝑥 + 2𝑦𝑦 ≤ 9
𝑥𝑥 − 𝑦𝑦 ≤ 3
𝑥𝑥 ≥ 0
𝑦𝑦 ≥ 1

What point in the feasible region maximizes P


for the objective function: 𝑃𝑃 = 3𝑥𝑥 + 𝑦𝑦?

Maximum and Minimum Values

EX #3: Constraints:
𝑥𝑥 + 𝑦𝑦 ≤ 8
2𝑥𝑥 + 𝑦𝑦 ≤ 10
𝑥𝑥 ≥ 0
𝑦𝑦 ≥ 0

Graph the system of constraints. Name all vertices.


Then find the values of x and y that maximizes the
objective function. 𝑁𝑁 = 100𝑥𝑥 + 40𝑦𝑦

© 2022 Jean Adams Flamingo Math.com


Using Linear Programming

EX #4: A baker earns 15¢ profit per glazed doughnut g, and 40¢ profit per jelly doughnut
j. If a customer wants to buy no more than a dozen doughnuts and wants to try
at least one of each kind, what is the maximum profit the baker can earn?

EX #5: Josh has 40 minutes to complete a government exam. There are 12 multiple-
choice questions worth 5 points each. There are also 5 short-answer questions
worth 8 points each. It takes about 2 minutes for Josh to answer the multiple-
choice questions m and about 8 minutes to complete the short-answer questions
s. Josh is trying to figure out how many of each type of question he should answer
to maximize his score.

© 2022 Jean Adams Flamingo Math.com


EX 6: A small company has five 3-ton trucks and four 5-ton trucks for hauling gravel.
Only 7 crews are available at any one time to operate the trucks. How many of
each kind of truck should be used to haul the maximum amount of gravel per trip?

Let x = the number of 3-ton trucks used


Let y = the number of 5-ton trucks used

Then the objective quantity for the number of tons of gravel hauled per trip is:
𝑓𝑓 𝑥𝑥, 𝑦𝑦 = 3𝑥𝑥 + 5𝑦𝑦

© 2022 Jean Adams Flamingo Math.com

You might also like