
Linear Programming and Systems of Inequalities
Authored by Anthony Clark
Mathematics
9th Grade
CCSS covered
Used 4+ times

AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
15 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
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.REI.D.12
2.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
Given the objective function: P = 30x + 50y
Which vertex maximizes the profit?
(0,0)
(6,2)
(8,0)
(0,6)
3.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
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
4.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
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.REI.D.12
5.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
Which of the following inequalities matches the given graph?
y ≤ -3/4 x + 3
y ≥ -3/4 x + 3
y < -3/4 x + 3
y > -3/4 x + 3
Tags
CCSS.HSA.REI.D.12
6.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
Which are vertices of the feasible region?
(0, 3) (3, 0) (5, 8)
(0, 6) (3, 5) (6, 5)
(3, 3) (8, 5) (5, 8)
(0, 5) (6, 0) (3, 3)
Tags
CCSS.HSA.REI.D.12
7.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
What do you call the area where all the shading overlaps?
the answer
the feasible region
the void
the objective function
Tags
CCSS.HSA.REI.D.12
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports

Continue with Google

Continue with Email

Continue with Classlink

Continue with Clever
or continue with

Microsoft
%20(1).png)
Apple
Others
Already have an account?