No student devices needed. Know more
16 questions
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
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)
When graphing constraints, what do you call the area where all the shading overlaps?
the answer
the feasible region
the void
the objective function
Given the objective function: P = 30x + 50y
Which vertex maximizes the profit?
(0,0)
(6,2)
(8,0)
(0,6)
Which corner point will maximize the Objective Function
Z = 5x + 2y
(7,4)
(3,10)
(10,1)
(8,5)
Sarah makes small purses (x) and big purses (y). She can make no more than 8 purses a week.
Which inequality represents the situation?
x + y ≤ 8
x + y > 8
2x + 3y ≤ 6
x + y ≤ 10
Sarah makes $30 for each small purse (x) and $50 for each big purse (y). What is the objective function?
P = 30x + 50y
P = 50x + 30y
Solve each of the following systems of linear inequalities a graphing approach. Verify using a graphing calculator. Which of following are the corner points?
(2, 0), (4, 5), (6, 0)
(2, 0), (3, 5), (0, 6)
(0, 2), (3.5, 4.5), (6, 2)
(0, 0), (3, 5), (6, 0)
Maximize P = 3x + y with the following constraints:
x+y ≤300
y ≥100
x ≤150
x = 0, y = 300
x = 150, y = 150
x = 100, y 150
x = 150, y = 100
Solve the system of inequalities. The feasible region is shown by the darkest blue shading.
Explore all questions with a free account