Linear Programming

It is a method for finding a maximum or minimum value of some quantity, given a set of constraints.

• Operations research

• Maximization

• Minimization

• Linear programming

Tags

CCSS.HSA.CED.A.3

CCSS.HSA.REI.D.12

In other words...what are the vertices of the feasible region?

• (0, 0), (0, 6), (6, 2), (8, 0)

• (0, 0), (6, 0), (2, 6), (0, 8)

Tags

CCSS.HSA.CED.A.2

CCSS.HSA.CED.A.3

CCSS.HSA.REI.C.6

CCSS.HSA.REI.D.12

When graphing constraints, what do you call the area where all the shading overlaps?

• the answer

• the feasible region

• the void

• the objective function

Tags

CCSS.HSA.CED.A.3

CCSS.HSA.REI.D.12

Given the objective function: P = 30x + 50y

Which vertex maximizes the profit?

• (0,0)

• (6,2)

• (8,0)

• (0,6)

Tags

CCSS.HSA.CED.A.2

CCSS.HSA.CED.A.3

CCSS.HSA.REI.C.6

CCSS.HSA.REI.D.10

CCSS.HSA.REI.D.12

Find the values of x and y that maximize the objective function P = 3x + 2y for the graph. What is the maximum value?
   

• maximum value at (5, 4); 32
• maximum value at (0, 8); 16
• maximum value at (9, 0); 27
• maximum value at (0, 0); 0

Tags

CCSS.HSA.CED.A.2

CCSS.HSA.CED.A.3

CCSS.HSA.REI.C.6

CCSS.HSA.REI.D.10

CCSS.HSA.REI.D.11

CCSS.HSA.REI.D.12

If a function has no maximum value, the shaded regions of the constraints are ___________ since they do not form a closed figure.

• linear

• objective

• unbounded

• feasible

Tags

CCSS.HSA.CED.A.3

CCSS.HSA.REI.D.12