Systems of Linear Inequalities in Two Variables

48 questions

Question 1Question

A digital marketing firm allocates its monthly advertising budget between search engine campaigns and social media campaigns. Let xx represent the amount, in thousands of dollars, spent on search engine campaigns, and let yy represent the amount, in thousands of dollars, spent on social media campaigns. The system of inequalities below represents the firm's monthly constraints:

x2yx+y253x+4y80y3\begin{aligned} x &\ge 2y \\ x + y &\le 25 \\ 3x + 4y &\le 80 \\ y &\ge 3 \end{aligned}

Based on these constraints, what is the maximum possible amount, in thousands of dollars, the firm can spend on social media campaigns?

Show answer & explanation

Answer: 8

Answer

8
To find the maximum possible value of yy, we analyze the boundaries of the feasible region. The boundary lines of the system are x=2yx = 2y, x+y=25x + y = 25, 3x+4y=803x + 4y = 80, and y=3y = 3. We can find the upper limit of yy by combining the inequalities x2yx \ge 2y and 3x+4y803x + 4y \le 80. Multiplying the first inequality by 33 gives 3x6y3x \ge 6y. Adding 4y4y to both sides yields 3x+4y10y3x + 4y \ge 10y. Because 3x+4y803x + 4y \le 80, it follows that 10y8010y \le 80, which simplifies to y8y \le 8. We verify that the point (16,8)(16, 8) satisfies the remaining inequalities: 16+8=242516 + 8 = 24 \le 25 and 838 \ge 3, which are both true. Thus, the maximum possible value of yy is 88.

Step-by-Step Solution

1
Relate the variables using the constraints to establish an upper bound for yy.
Since x2yx \ge 2y, multiplying both sides by 33 gives 3x6y3x \ge 6y.
This allows us to express the 3x3x term in the cost inequality in terms of yy to determine the maximum boundary.
2
Substitute 3x6y3x \ge 6y into the inequality 3x+4y803x + 4y \le 80.
We get 6y+4y3x+4y806y + 4y \le 3x + 4y \le 80, which simplifies to 10y8010y \le 80.
This establishes a direct upper limit for yy based on the intersection of the two active boundary lines.
3
Solve the inequality 10y8010y \le 80 for yy.
y8y \le 8.
This determines that the maximum possible value for yy under these constraints is 88.
4
Verify that the point corresponding to y=8y = 8 satisfies all other constraints in the system.
When y=8y = 8, the boundary x=2yx = 2y gives x=16x = 16. Checking (16,8)(16, 8) against all inequalities:
- 162(8)    161616 \ge 2(8) \implies 16 \ge 16 (True)
- 16+825    242516 + 8 \le 25 \implies 24 \le 25 (True)
- 3(16)+4(8)80    80803(16) + 4(8) \le 80 \implies 80 \le 80 (True)
- 838 \ge 3 (True)
We must verify that the optimal vertex lies within the feasible region defined by all four inequalities.

Key Concept

Maximizing a coordinate value within a bounded feasible region defined by a system of linear inequalities.
Question 2Question
{y2x+4y<12x+2\begin{cases} y \geq -2x + 4 \\ y < \frac{1}{2}x + 2 \end{cases}

Which of the following ordered pairs (x,y)(x, y) is a solution to the system of inequalities above?

Show answer & explanation

Answer: (1,2)(1, 2)

Answer

The ordered pair (1,2)(1, 2) is a solution to the system of inequalities.
Substituting the coordinates of the point stating (1,2)(1, 2) into the system of inequalities produces two true statements: 22(1)+42 \geq -2(1) + 4 simplifies to 222 \geq 2, which is true; and 2<12(1)+22 < \frac{1}{2}(1) + 2 simplifies to 2<2.52 < 2.5, which is also true. Therefore, the ordered pair (1,2)(1, 2) is a solution to the system.

Step-by-Step Solution

1
Substitute the coordinates of each option into the first inequality, y2x+4y \geq -2x + 4.
For (1,2)(1, 2), 222 \geq 2 (True). For (0,1)(0, -1), 14-1 \geq 4 (False). For (2,3)(2, 3), 303 \geq 0 (True). For (0,3)(0, 3), 343 \geq 4 (False).
To determine which ordered pairs satisfy the first inequality.
2
Substitute the coordinates of the remaining candidate pairs, (1,2)(1, 2) and (2,3)(2, 3), into the second inequality, y<12x+2y < \frac{1}{2}x + 2.
For (1,2)(1, 2), 2<2.52 < 2.5 (True). For (2,3)(2, 3), 3<33 < 3 (False).
To determine which of the remaining candidates also satisfies the second inequality.
3
Identify the ordered pair that satisfies both inequalities in the system.
Only (1,2)(1, 2) satisfies both inequalities.
An ordered pair is a solution to a system of inequalities if and only if it satisfies all inequalities in the system.

Key Concept

Verifying solutions to a system of linear inequalities by substitution.
Question 3Question

Which of the following ordered pairs (x,y)(x, y) is a solution to the system of inequalities below?

yx+1y>2x+4\begin{aligned} y &\geq x + 1 \\ y &> -2x + 4 \end{aligned}
Show answer & explanation

Answer: (1,3)(1, 3)

Answer

The ordered pair (1,3)(1, 3)
The ordered pair (1,3)(1, 3) is the correct answer because substituting x=1x = 1 and y=3y = 3 into the system of inequalities results in two true statements: 31+13 \geq 1 + 1 simplifies to 323 \geq 2 (true), and 3>2(1)+43 > -2(1) + 4 simplifies to 3>23 > 2 (true).

Step-by-Step Solution

1
Substitute the coordinates of the ordered pair (1,3)(1, 3) into the first inequality, yx+1y \geq x + 1.
31+1323 \geq 1 + 1 \Rightarrow 3 \geq 2, which is true.
To be a solution to the system, the ordered pair must satisfy the first inequality.
2
Substitute the coordinates of the ordered pair (1,3)(1, 3) into the second inequality, y>2x+4y > -2x + 4.
3>2(1)+43>23 > -2(1) + 4 \Rightarrow 3 > 2, which is true.
The ordered pair must also satisfy the second inequality to be a solution to the system.
3
Verify that the other ordered pairs do not satisfy both inequalities.
None of the other options satisfy both inequalities: (3,1)(3, 1) fails the first inequality, (0,2)(0, 2) fails the second inequality, and (1,5)(-1, 5) fails the second inequality.
Ensuring that there is exactly one correct solution.

Key Concept

A solution to a system of linear inequalities in two variables is an ordered pair (x,y)(x, y) that makes all inequalities in the system true.

Alternative Method

Alternatively, you can graph the two inequalities on a coordinate plane. The region representing the solution to the system is the overlapping shaded area of both inequalities. By plotting each point, you can visually identify which point lies within this double-shaded region.
Estimated Time:1m 0s
Question 4Question

A student wants to buy xx notebooks and yy pens. The student must buy at least 33 notebooks. Each notebook costs 33 dollars and each pen costs 22 dollars. If the student can spend a maximum of 1515 dollars, what is the maximum number of pens the student can buy?

Show answer & explanation

Answer: 3

Answer

3
The correct answer is 3. The constraints are represented by the system of inequalities x3x \geq 3 and 3x+2y153x + 2y \leq 15. To find the maximum number of pens yy, we minimize the number of notebooks xx by setting x=3x = 3. Substituting x=3x = 3 into the budget inequality gives 3(3)+2y153(3) + 2y \leq 15, which simplifies to 9+2y159 + 2y \leq 15. Subtracting 99 from both sides results in 2y62y \leq 6. Dividing by 22 yields y3y \leq 3. Therefore, the maximum number of pens the student can buy is 3.

Step-by-Step Solution

1
Set up the system of inequalities from the given constraints.
The system of inequalities is x3x \geq 3 and 3x+2y153x + 2y \leq 15, where xx represents the number of notebooks and yy represents the number of pens.
To represent the minimum number of notebooks required and the total budget limit.
2
Substitute the minimum possible value of xx into the budget inequality to maximize yy.
Setting x=3x = 3 gives 3(3)+2y153(3) + 2y \leq 15, which simplifies to 9+2y159 + 2y \leq 15.
Since the cost per notebook is positive, minimizing the number of notebooks leaves the maximum amount of budget for purchasing pens.
3
Solve the inequality for yy.
2y6    y32y \leq 6 \implies y \leq 3.
To find the upper bound for the number of pens the student can buy.

Key Concept

Solving a system of linear inequalities in a real-world context to find a maximum value.
Question 5Question

In the xyxy-plane, a point (x,y)(x, y) is a solution to the system of inequalities below.

y3x+14y \leq -3x + 14
y4x7y \leq 4x - 7

What is the maximum possible value of yy?

Show answer & explanation

Answer: 5

Answer

The maximum possible value of yy is 5.
The maximum value of yy is found at the intersection of the two boundary lines, y=3x+14y = -3x + 14 and y=4x7y = 4x - 7. Solving the system of equations gives x=3x = 3 and y=5y = 5. Because the inequalities are both of the 'less than or equal to' type, any point in the solution set must lie on or below both lines. For x<3x < 3, the value of yy is limited by y4x7y \leq 4x - 7, which is strictly less than 5. For x>3x > 3, the value of yy is limited by y3x+14y \leq -3x + 14, which is also strictly less than 5. Thus, the maximum value of yy is 5.

Step-by-Step Solution

1
Set the two boundary equations equal to find their intersection point.
3x+14=4x7-3x + 14 = 4x - 7
The maximum value of yy under these constraints occurs at the intersection of the two boundary lines.
2
Solve the equation for xx.
x=3x = 3
Isolating xx determines the x-coordinate of the intersection point.
3
Substitute x=3x = 3 back into one of the boundary equations to solve for yy.
y=5y = 5
This yields the y-coordinate of the intersection point, which is the upper bound for yy in the solution set.

Key Concept

Determining the maximum value of a variable in the solution set of a system of linear inequalities by finding the intersection of their boundary lines.
Estimated Time:1m 30s
Question 6Question

A graphic designer is exporting images for a website. There are two types of images: standard images and high-resolution images. Each standard image, xx, requires 3 megabytes (MB) of storage and takes 2 seconds to upload. Each high-resolution image, yy, requires 8 MB of storage and takes 5 seconds to upload. The designer must limit the total storage of the exported images to at most 120 MB and the total upload time to at least 60 seconds. Which of the following systems of inequalities models this situation?

Show answer & explanation

Answer: 3x+8y1203x + 8y \leq 120
2x+5y602x + 5y \geq 60

Answer

The system of inequalities is 3x+8y1203x + 8y \leq 120 and 2x+5y602x + 5y \geq 60.
The correct system models the limits correctly. The storage constraint is represented by 3x+8y1203x + 8y \leq 120 since 'at most' corresponds to a less-than-or-equal-to sign. The upload time constraint is represented by 2x+5y602x + 5y \geq 60 since 'at least' corresponds to a greater-than-or-equal-to sign.

Step-by-Step Solution

1
Set up the inequality for the storage constraint.
3x+8y1203x + 8y \leq 120
Each standard image uses 3 megabytes and each high-resolution image uses 8 megabytes. The total storage must be at most (less than or equal to) 120 megabytes.
2
Set up the inequality for the upload time constraint.
2x+5y602x + 5y \geq 60
Each standard image takes 2 seconds and each high-resolution image takes 5 seconds to upload. The total upload time must be at least (greater than or equal to) 60 seconds.
3
Combine both inequalities into a system.
The system containing 3x+8y1203x + 8y \leq 120 and 2x+5y602x + 5y \geq 60.
Both constraints must be satisfied simultaneously.

Key Concept

Translating verbal constraints into systems of linear inequalities in two variables.
Question 7Question
A system of inequalities is shown below.
y3x+15y2x+2\begin{aligned} y &\leq -3x + 15 \\ y &\leq 2x + 2 \end{aligned}
If (x,y)(x, y) is a solution to the system, what is the maximum possible integer value of yy?
Show answer & explanation

Answer: 7

Answer

7
The maximum value of yy in the system occurs at the intersection of the boundary lines y=3x+15y = -3x + 15 and y=2x+2y = 2x + 2. Solving for the intersection gives x=2.6x = 2.6 and y=7.2y = 7.2. Since any point in the solution set must satisfy y7.2y \leq 7.2, the largest possible integer value for yy is 7. We can confirm this is achievable because when y=7y = 7, xx can be any value in the range [2.5,2.67][2.5, 2.67] (such as x=2.6x=2.6), which satisfies both inequalities.

Step-by-Step Solution

1
Find the intersection point of the boundary lines.
Set the two equations equal to find the xx-coordinate: 3x+15=2x+2    5x=13    x=2.6-3x + 15 = 2x + 2 \implies 5x = 13 \implies x = 2.6.
The maximum value of yy in a system bounded from above by two lines with opposing slopes occurs at their point of intersection.
2
Calculate the corresponding maximum yy-value.
Substitute x=2.6x = 2.6 into either boundary equation: y=2(2.6)+2=7.2y = 2(2.6) + 2 = 7.2.
This determines the absolute upper bound of yy for any coordinate pair in the solution set.
3
Determine the maximum integer value of yy.
Since y7.2y \leq 7.2, the largest integer value that yy can take is 7.
The question asks specifically for the maximum integer value of yy, and since 77.27 \leq 7.2, a solution exists at this yy-value.
4
Verify that a solution exists for y=7y = 7.
For y=7y = 7, the system requires 73x+15    x2.677 \leq -3x + 15 \implies x \leq 2.67 and 72x+2    x2.57 \leq 2x + 2 \implies x \geq 2.5. The interval [2.5,2.67][2.5, 2.67] is non-empty, so valid solutions (e.g., (2.6,7)(2.6, 7)) exist.
This confirms that y=7y = 7 is attainable within the feasible region.

Key Concept

Optimization of variables within systems of linear inequalities
Question 8Question

A graphic designer allocates their weekly work time between designing layouts, which takes dd hours, and client consultations, which takes cc hours. The designer works a maximum of 35 hours per week. Additionally, the designer spends at least twice as much time designing layouts as they do in client consultations. Which of the following systems of inequalities represents this situation?

Show answer & explanation

Answer: d+c35d2c\begin{aligned} d + c &\leq 35 \\ d &\geq 2c \end{aligned}

Answer

The system with the inequalities d+c35d + c \leq 35 and d2cd \geq 2c
The system containing the inequalities d+c35d + c \leq 35 and d2cd \geq 2c is correct. The constraint 'works a maximum of 35 hours per week' means the sum of the hours, d+cd + c, must be less than or equal to 35 (d+c35d + c \leq 35). The constraint 'spends at least twice as much time designing layouts as they do in client consultations' means that design hours, dd, must be greater than or equal to twice the consultation hours, cc (d2cd \geq 2c).

Step-by-Step Solution

1
Identify the inequality representing the limit on total weekly hours.
d+c35d + c \leq 35
The phrase 'works a maximum of 35 hours per week' means the total hours spent on designing (dd) and consulting (cc) cannot exceed 35.
2
Identify the inequality representing the relative relationship between designing and consulting hours.
d2cd \geq 2c
The phrase 'at least twice as much time designing layouts as they do in client consultations' means the design hours (dd) must be greater than or equal to two times the consultation hours (2c2c).
3
Combine the individual inequalities into a system.
The system consists of d+c35d + c \leq 35 and d2cd \geq 2c.
Both conditions must be satisfied simultaneously to represent the designer's weekly schedule constraint.

Key Concept

Systems of Linear Inequalities in Two Variables
Estimated Time:1m 0s
Question 9Question

A closed triangular region in the coordinate plane is defined by the following system of linear inequalities:

y2x4yx+8x1\begin{aligned} y &\geq 2x - 4 \\ y &\leq -x + 8 \\ x &\geq 1 \end{aligned}

What is the maximum possible value of the expression 2x+y2x + y for any point (x,y)(x, y) that lies within or on the boundary of this region?

Show answer & explanation

Answer: 12

Answer

The maximum possible value of the expression 2x+y2x + y is 12.
To find the maximum possible value of the expression 2x+y2x + y subject to the given system of inequalities, we first identify the boundary lines and find the vertices of the bounded triangular region in the coordinate plane. The boundary lines are y=2x4y = 2x - 4, y=x+8y = -x + 8, and x=1x = 1. The intersection of y=2x4y = 2x - 4 and y=x+8y = -x + 8 occurs at x=4,y=4x = 4, y = 4, which gives vertex (4,4)(4, 4). The intersection of y=2x4y = 2x - 4 and x=1x = 1 occurs at (1,2)(1, -2). The intersection of y=x+8y = -x + 8 and x=1x = 1 occurs at (1,7)(1, 7). Evaluating the linear expression 2x+y2x + y at these three vertices gives 2(4)+4=122(4) + 4 = 12, 2(1)2=02(1) - 2 = 0, and 2(1)+7=92(1) + 7 = 9. By the corner point theorem, the maximum value of a linear function on a closed polygonal region occurs at one of the vertices. Comparing the values, the maximum possible value is 12.

Step-by-Step Solution

1
Find the vertex formed by the intersection of the boundary lines y=2x4y = 2x - 4 and y=x+8y = -x + 8.
Vertex A(4,4)A(4, 4)
Setting the two equations equal: 2x4=x+8    3x=12    x=42x - 4 = -x + 8 \implies 3x = 12 \implies x = 4. Substituting x=4x = 4 back into either equation yields y=4y = 4.
2
Find the vertex formed by the intersection of the boundary line y=2x4y = 2x - 4 and the vertical line x=1x = 1.
Vertex B(1,2)B(1, -2)
Substituting x=1x = 1 into y=2x4y = 2x - 4 gives y=2(1)4=2y = 2(1) - 4 = -2.
3
Find the vertex formed by the intersection of the boundary line y=x+8y = -x + 8 and the vertical line x=1x = 1.
Vertex C(1,7)C(1, 7)
Substituting x=1x = 1 into y=x+8y = -x + 8 gives y=1+8=7y = -1 + 8 = 7.
4
Evaluate the expression 2x+y2x + y at each of the three vertices.
At A(4,4)A(4, 4), the value is 1212; at B(1,2)B(1, -2), the value is 00; at C(1,7)C(1, 7), the value is 99.
According to the Corner Point Theorem of linear programming, the maximum or minimum of a linear objective function on a closed bounded region must occur at one of the vertices.
5
Identify the maximum value from the evaluated points.
The maximum value is 12.
Comparing the values 12, 0, and 9 shows that 12 is the largest value.

Key Concept

Linear Programming and Systems of Inequalities
Question 10Question

In the xyxy-plane, the solution set to the system of inequalities below is a bounded region.

y2x+21y12x+9yx+5x2y1\begin{aligned} y &\leq -2x + 21 \\ y &\leq -\frac{1}{2}x + 9 \\ y &\geq -x + 5 \\ x &\geq 2 \\ y &\geq 1 \end{aligned}

What is the maximum possible value of 3x+2y3x + 2y for a point (x,y)(x, y) in this region?

Show answer & explanation

Answer: 34

Answer

34
The correct value is 34. The solution set to the system of inequalities is a bounded pentagonal region. Evaluating the expression 3x+2y3x + 2y at each vertex of this region yields: 1212 at (2,3)(2, 3), 2222 at (2,8)(2, 8), 3434 at (8,5)(8, 5), 3232 at (10,1)(10, 1), and 1414 at (4,1)(4, 1). Comparing these values shows that the maximum value is 34.

Step-by-Step Solution

1
Understand the behavior of the objective function over the region
The maximum value of a linear expression 3x+2y3x + 2y over a closed, bounded polygonal region must occur at one of the vertices (corner points) of the region.
This is a fundamental theorem of linear programming, which simplifies the search for the maximum value to only the boundary intersections of the system.
2
Determine the vertices of the feasible region
The boundary lines are y=2x+21y = -2x + 21, y=12x+9y = -\frac{1}{2}x + 9, y=x+5y = -x + 5, x=2x = 2, and y=1y = 1. Finding their intersections that satisfy all inequalities yields five vertices: (2,3)(2, 3), (2,8)(2, 8), (8,5)(8, 5), (10,1)(10, 1), and (4,1)(4, 1).
Solving the pairwise equations of lines that bound the shaded region determines the exact coordinates of all corner points.
3
Evaluate the expression 3x+2y3x + 2y at each of the five vertices
At (2,3)(2, 3): 3(2)+2(3)=123(2) + 2(3) = 12
At (2,8)(2, 8): 3(2)+2(8)=223(2) + 2(8) = 22
At (8,5)(8, 5): 3(8)+2(5)=343(8) + 2(5) = 34
At (10,1)(10, 1): 3(10)+2(1)=323(10) + 2(1) = 32
At (4,1)(4, 1): 3(4)+2(1)=143(4) + 2(1) = 14
Calculating the value at each candidate vertex allows us to compare and find the absolute maximum.
4
Compare the evaluated values
The maximum value is 3434, occurring at the vertex (8,5)(8, 5).
Comparing all calculated values shows that 34 is the largest possible value.

Key Concept

Linear Programming and Bounded Systems of Inequalities
Estimated Time:3m 0s
Question 11Question
In the xyxy-plane, a system of inequalities is defined as follows:
y2x4yx+8y12x\begin{aligned} y &\geq 2x - 4 \\ y &\leq -x + 8 \\ y &\geq \frac{1}{2}x \end{aligned}
How many points (x,y)(x, y) with integer coordinates satisfy this system of inequalities?
Show answer & explanation

Answer: 5

Answer

The total number of points with integer coordinates that satisfy the system is 5.
The system of inequalities defines a closed triangular region in the coordinate plane. Finding the vertices of this triangle gives the horizontal boundaries for xx, which are 832.67\frac{8}{3} \approx 2.67 and 1635.33\frac{16}{3} \approx 5.33. The only integers in this range are x=3x = 3, x=4x = 4, and x=5x = 5. Testing each of these integers in the inequalities shows that when x=3x = 3, yy can be 2,3,4,2, 3, 4, or 55 (4 points); when x=4x = 4, yy can only be 44 (1 point); and when x=5x = 5, there are no valid solutions. Adding these together gives a total of 5 points.

Step-by-Step Solution

1
Find the intersection points of the three boundary lines to define the vertices of the solution region.
The intersection of y=2x4y = 2x - 4 and y=12xy = \frac{1}{2}x is at x=832.67,y=431.33x = \frac{8}{3} \approx 2.67, y = \frac{4}{3} \approx 1.33.
The intersection of y=x+8y = -x + 8 and y=12xy = \frac{1}{2}x is at x=1635.33,y=832.67x = \frac{16}{3} \approx 5.33, y = \frac{8}{3} \approx 2.67.
The intersection of y=2x4y = 2x - 4 and y=x+8y = -x + 8 is at x=4,y=4x = 4, y = 4.
Finding the vertices determines the exact boundaries of the solution region in the coordinate plane.
2
Identify the integer xx-coordinates that lie within the horizontal span of the region.
The xx-coordinates of the region range from 832.67\frac{8}{3} \approx 2.67 to 1635.33\frac{16}{3} \approx 5.33. The integers in this interval are x=3x = 3, x=4x = 4, and x=5x = 5.
Since both coordinates must be integers, we only need to test integer values of xx that fall within the boundaries of the region.
3
Find the integer yy-values for each candidate xx-value.
For x=3x = 3: The inequalities require y2(3)4=2y \geq 2(3) - 4 = 2, y3+8=5y \leq -3 + 8 = 5, and y12(3)=1.5y \geq \frac{1}{2}(3) = 1.5. Thus, 2y52 \leq y \leq 5. The integer solutions are y=2,3,4,5y = 2, 3, 4, 5 (4 points).
For x=4x = 4: The inequalities require y2(4)4=4y \geq 2(4) - 4 = 4, y4+8=4y \leq -4 + 8 = 4, and y12(4)=2y \geq \frac{1}{2}(4) = 2. Thus, 4y44 \leq y \leq 4, which means y=4y = 4 (1 point).
For x=5x = 5: The inequalities require y2(5)4=6y \geq 2(5) - 4 = 6 and y5+8=3y \leq -5 + 8 = 3. No real number yy can satisfy both y6y \geq 6 and y3y \leq 3 (0 points).
Evaluating the system at each candidate xx-value reveals the set of matching integer yy-values.
4
Sum the number of points found for each integer xx-value.
4 points (when x=3x = 3) + 1 point (when x=4x = 4) + 0 points (when x=5x = 5) = 5 points.
This yields the total number of integer coordinate pairs (x,y)(x, y) that satisfy the system of inequalities.

Key Concept

Analyzing a bounded region defined by a system of linear inequalities to find discrete integer solutions (lattice points).

Alternative Method

Graph the three boundary lines on a grid: y=2x4y = 2x - 4 (solid line, shaded above), y=x+8y = -x + 8 (solid line, shaded below), and y=12xy = \frac{1}{2}x (solid line, shaded above). Identify the triangular intersection region on the grid and count the grid intersections (lattice points) that lie within or on the boundaries of this shaded triangle.
Estimated Time:2m 30s
Question 12Question

An online store sells small gift boxes for 1010 dollars each and large gift boxes for 1515 dollars each. A customer wants to buy a total of at most 1010 boxes. If the customer must spend at least 120120 dollars on the boxes, what is the minimum number of large gift boxes the customer must buy?

Show answer & explanation

Answer: 4

Answer

The minimum number of large gift boxes the customer must buy is 4.
Using the constraints from the problem, we set up the system of inequalities: x+y10x + y \leq 10 and 10x+15y12010x + 15y \geq 120. Expressing the first inequality as x10yx \leq 10 - y and substituting it into the second gives 10(10y)+15y12010(10 - y) + 15y \geq 120. Simplifying this results in 100+5y120100 + 5y \geq 120, which simplifies to 5y205y \geq 20, or y4y \geq 4. Therefore, the minimum number of large gift boxes the customer must buy is 44.

Step-by-Step Solution

1
Define variables for the quantities of each box.
Let xx be the number of small boxes and yy be the number of large boxes.
Establishing variables is necessary to translate the word problem into algebraic inequalities.
2
Write the system of inequalities representing the constraints.
x+y10x + y \leq 10 and 10x+15y12010x + 15y \geq 120
The total number of boxes is at most 1010, and the total cost must be at least 120120 dollars.
3
Express xx in terms of yy using the first inequality.
x10yx \leq 10 - y
This allows substitution into the second inequality to solve for the target variable yy.
4
Substitute x10yx \leq 10 - y into the second inequality and simplify.
100+5y120100 + 5y \geq 120
Solving the resulting single-variable inequality will determine the possible values of yy.
5
Solve the inequality for yy.
y4y \geq 4
Subtracting 100100 and dividing by 55 isolates yy to show its minimum possible value is 44.

Key Concept

Systems of Linear Inequalities in Two Variables
Question 13Question

A sports store orders standard helmets for 2020 dollars each and premium helmets for 5050 dollars each. The store can spend at most 22002{}200 dollars on this order. The distributor requires the store to order at least 6060 helmets in total. If the store decides to order at least 1515 premium helmets, what is the maximum number of standard helmets that the store can order?

Show answer & explanation

Answer: 72

Answer

The maximum number of standard helmets the store can order is 72.
By setting the number of premium helmets to its minimum allowed value of 1515 to maximize the budget remaining for standard helmets, we find 20x145020x \leq 1450, which yields x72.5x \leq 72.5. Since standard helmets must be ordered in whole numbers, the maximum number is 7272, which also satisfies the minimum total order of 6060 helmets (72+15=876072 + 15 = 87 \geq 60).

Step-by-Step Solution

1
Define variables and translate constraints into inequalities
Let xx be the number of standard helmets and yy be the number of premium helmets. The constraints are 20x+50y220020x + 50y \leq 2200, x+y60x + y \geq 60, and y15y \geq 15.
To represent the problem's mathematical relationships using a system of linear inequalities.
2
Solve for the upper limit of xx using the budget constraint and the minimum value of yy
Since 20x220050y20x \leq 2200 - 50y, xx is maximized when yy is at its minimum value, y=15y = 15. Substituting y=15y = 15 yields 20x+7502200    20x1450    x72.520x + 750 \leq 2200 \implies 20x \leq 1450 \implies x \leq 72.5.
To find the maximum possible value of standard helmets under the budget constraint.
3
Verify with the minimum total order constraint and determine the maximum integer value
Checking x+y60x + y \geq 60 with y=15y = 15 gives x+1560    x45x + 15 \geq 60 \implies x \geq 45. Since xx must satisfy 45x72.545 \leq x \leq 72.5 and must be an integer, the maximum integer value is 7272.
To ensure the solution is physically possible as a whole number of items and satisfies all constraints.

Key Concept

Systems of Linear Inequalities in Two Variables
Question 14Question

A florist is making bouquets. Each small bouquet requires 22 roses, and each large bouquet requires 55 roses. The florist has at most 4040 roses available for these bouquets. Additionally, the florist wants to make more than 1010 bouquets in total. If xx represents the number of small bouquets and yy represents the number of large bouquets, which of the following systems of inequalities represents this situation?

Show answer & explanation

Answer: 2x+5y402x + 5y \leq 40 and x+y>10x + y > 10

Answer

The system of inequalities 2x+5y402x + 5y \leq 40 and x+y>10x + y > 10.
The correct system of inequalities matches the constraints given in the problem. The total number of roses used by xx small bouquets and yy large bouquets is 2x+5y2x + 5y. Since the florist has at most 4040 roses, this is represented by 2x+5y402x + 5y \leq 40. The total number of bouquets is x+yx + y. Since the florist wants to make more than 1010 bouquets, this is represented by x+y>10x + y > 10.

Step-by-Step Solution

1
Identify the inequality representing the constraint on the total number of roses.
2x+5y402x + 5y \leq 40
Each small bouquet uses 22 roses (2x2x) and each large bouquet uses 55 roses (5y5y). The total roses must be 'at most' 4040, which corresponds to the inequality symbol \leq.
2
Identify the inequality representing the constraint on the total number of bouquets.
x+y>10x + y > 10
The total number of bouquets is the sum of small bouquets (xx) and large bouquets (yy). The florist wants 'more than' 1010 bouquets, which corresponds to the inequality symbol >>.
3
Combine the two inequalities into a single system.
The system is 2x+5y402x + 5y \leq 40 and x+y>10x + y > 10.
Both conditions must be met simultaneously.

Key Concept

Translating real-world constraints into a system of linear inequalities in two variables.
Question 15Question

A school club is planning a fundraiser by selling two types of customized keychains: acrylic keychains and metal keychains. Acrylic keychains cost 3tomakeandsellfor3 to make and sell for 5, while metal keychains cost 5tomakeandsellfor5 to make and sell for 8. The club has a budget of at most 150toproducethekeychains,andtheywanttomakeatleast40keychainsintotal.Let150 to produce the keychains, and they want to make at least 40 keychains in total. Let x representthenumberofacrylickeychainsand represent the number of acrylic keychains and y$ represent the number of metal keychains. Which of the following systems of inequalities represents this situation?

Show answer & explanation

Answer: 3x+5y1503x + 5y \leq 150 and x+y40x + y \geq 40

Answer

3x+5y1503x + 5y \leq 150 and x+y40x + y \geq 40
The correct system of inequalities must reflect the constraints on the budget and the total number of keychains. The budget is at most 150,whichmeansthetotalproductioncostmustbelessthanorequalto150.Sinceeachacrylickeychaincosts150, which means the total production cost must be less than or equal to 150. Since each acrylic keychain costs 3 to make and each metal keychain costs 5,thecostconstraintisrepresentedby5, the cost constraint is represented by 3x + 5y \leq 150 .Theclubalsowantstomakeatleast40keychains,whichmeansthetotalcountmustbegreaterthanorequalto40.Thisconstraintisrepresentedby. The club also wants to make at least 40 keychains, which means the total count must be greater than or equal to 40. This constraint is represented by x + y \geq 40 .Together,theseformthesystem. Together, these form the system 3x + 5y \leq 150 and and x + y \geq 40$.

Step-by-Step Solution

1
Identify the variables and their meanings from the problem statement.
xx represents the number of acrylic keychains, and yy represents the number of metal keychains.
Understanding the variable definitions is necessary to construct the constraints correctly.
2
Set up the budget inequality using the production costs.
3x+5y1503x + 5y \leq 150
Each acrylic keychain costs 3tomake,eachmetalkeychaincosts3 to make, each metal keychain costs 5, and the total cost must be at most (less than or equal to) $150.
3
Set up the quantity inequality.
x+y40x + y \geq 40
The club wants to make a total of at least (greater than or equal to) 40 keychains.

Key Concept

Systems of linear inequalities in context
Question 16Question

A chef is preparing portions of roasted vegetables and mashed potatoes for a catered event. Each portion of roasted vegetables requires 33 ounces of potatoes, and each portion of mashed potatoes requires 66 ounces of potatoes. The chef has a total of at most 9090 ounces of potatoes available. The chef must prepare at least 88 portions of roasted vegetables and at least 55 portions of mashed potatoes. If vv represents the number of portions of roasted vegetables that the chef prepares, what is the maximum possible value of vv?

Show answer & explanation

Answer: 20

Answer

The maximum possible value of vv is 20.
The maximum number of portions of roasted vegetables the chef can prepare is 20 because minimizing the number of mashed potato portions to its boundary constraint of 5 maximizes the remaining resources, yielding 3v906(5)    3v60    v203v \leq 90 - 6(5) \implies 3v \leq 60 \implies v \leq 20.

Step-by-Step Solution

1
Formulate the inequality representing the potato weight constraint.
3v+6p903v + 6p \leq 90, where vv is the number of portions of roasted vegetables and pp is the number of portions of mashed potatoes.
Each portion of roasted vegetables uses 33 ounces of potatoes, each portion of mashed potatoes uses 66 ounces of potatoes, and the total amount used cannot exceed 9090 ounces.
2
Formulate the inequalities representing the minimum quantity constraints.
v8v \geq 8 and p5p \geq 5
The chef must make at least 88 portions of roasted vegetables and at least 55 portions of mashed potatoes.
3
Isolate the variable vv in the potato limit inequality.
v302pv \leq 30 - 2p
Subtracting 6p6p from both sides of 3v+6p903v + 6p \leq 90 yields 3v906p3v \leq 90 - 6p, and dividing the entire inequality by 33 gives v302pv \leq 30 - 2p.
4
Determine the maximum value of vv by substituting the minimum possible value of pp.
v302(5)    v20v \leq 30 - 2(5) \implies v \leq 20
To maximize vv, we must minimize the subtracted term 2p2p. The minimum allowed value of pp is 55.

Key Concept

Optimization in systems of linear inequalities
Question 17Question

A small factory manufactures two types of toys: wood blocks and toy cars. Let xx represent the number of wood blocks produced daily, and let yy represent the number of toy cars produced daily. The daily production must satisfy the following constraints:

* The total number of toys produced daily cannot exceed 40: x+y40x + y \le 40
* Each wood block requires 2 minutes of painting, and each toy car requires 1 minute of painting. The total daily painting time is at most 60 minutes: 2x+y602x + y \le 60
* The number of wood blocks produced cannot exceed the number of toy cars produced by more than 15: yx15y \ge x - 15

If the factory must produce a non-negative number of both types of toys, what is the maximum possible number of wood blocks the factory can produce daily?

Show answer & explanation

Answer: 25

Answer

The maximum possible number of wood blocks the factory can produce daily is 25.
The correct answer is the value that represents the maximum xx-coordinate within the feasible region. By graphing the inequalities, we find the vertices of the shaded region are (0,0)(0, 0), (15,0)(15, 0), (25,10)(25, 10), (20,20)(20, 20), and (0,40)(0, 40). The maximum xx-value among these vertices is 25, which occurs at the intersection of the painting time constraint and the demand constraint.

Step-by-Step Solution

1
Identify the system of inequalities representing the constraints.
The system of inequalities is:
1) x+y40x + y \le 40
2) 2x+y602x + y \le 60
3) yx15y \ge x - 15
4) x0x \ge 0
5) y0y \ge 0
This establishes the boundaries of the feasible region on the coordinate plane.
2
Find the boundary intersection points (vertices of the feasible region) that could maximize xx.
The relevant intersections are:
- The intersection of (1) and (2): x+y=40x + y = 40 and 2x+y=60    x=20,y=202x + y = 60 \implies x = 20, y = 20.
- The intersection of (2) and (3): 2x+y=602x + y = 60 and y=x15    2x+(x15)=60    3x=75    x=25,y=10y = x - 15 \implies 2x + (x - 15) = 60 \implies 3x = 75 \implies x = 25, y = 10.
- The intersection of (3) and the x-axis (y=0y = 0): 0=x15    x=15,y=00 = x - 15 \implies x = 15, y = 0.
The maximum value of a variable in a bounded linear feasibility region must occur at one of the vertices of the region.
3
Test the vertices to verify they satisfy all inequalities in the system.
- For (20,20)(20, 20): 20+204020 + 20 \le 40 (True), 2(20)+20602(20) + 20 \le 60 (True), 20201520 \ge 20 - 15 (True).
- For (25,10)(25, 10): 25+10=354025 + 10 = 35 \le 40 (True), 2(25)+10=60602(25) + 10 = 60 \le 60 (True), 10251510 \ge 25 - 15 (True).
- For (15,0)(15, 0): 15+04015 + 0 \le 40 (True), 2(15)+0602(15) + 0 \le 60 (True), 015150 \ge 15 - 15 (True).
This ensures that the intersection points actually lie within the feasible region defined by all constraints.
4
Compare the xx-values of the valid vertices to find the maximum.
The candidate xx-values are 20, 25, and 15. The maximum value is 25.
This determines the absolute maximum coordinate value within the bounded region.

Key Concept

Solving systems of linear inequalities by identifying the vertices of the feasible region to optimize a coordinate value.
Question 18Question

Which of the following ordered pairs (x,y)(x, y) is a solution to the system of inequalities below?

y3x+1y<2x+5\begin{aligned} y &\geq 3x + 1 \\ y &< -2x + 5 \end{aligned}
Show answer & explanation

Answer: (0,2)(0, 2)

Answer

(0,2)(0, 2)
The ordered pair (0,2)(0, 2) is correct because substituting these values into both inequalities results in true statements. Specifically, 23(0)+12 \geq 3(0) + 1 becomes 212 \geq 1, which is true, and 2<2(0)+52 < -2(0) + 5 becomes 2<52 < 5, which is also true.

Step-by-Step Solution

1
Substitute the coordinates of the correct ordered pair into the first inequality, y3x+1y \geq 3x + 1.
23(0)+1212 \geq 3(0) + 1 \Rightarrow 2 \geq 1, which is true.
To be a solution to the system, an ordered pair must satisfy both inequalities in the system.
2
Substitute the coordinates of the same ordered pair into the second inequality, y<2x+5y < -2x + 5.
2<2(0)+52<52 < -2(0) + 5 \Rightarrow 2 < 5, which is true.
To verify the solution, we check if it satisfies the second constraint.

Key Concept

Testing coordinate solutions in a system of linear inequalities
Question 19Question

An artist sells small prints for 44 dollars each and large prints for 99 dollars each. The artist wants to sell at least 1515 prints in total and earn at least 8080 dollars from these sales. If the artist sells 55 small prints, what is the minimum number of large prints the artist must sell to meet both conditions?

Show answer & explanation

Answer: 10

Answer

The minimum number of large prints the artist must sell is 10.
Substituting the value of small prints (x=5x = 5) into the total count inequality x+y15x + y \geq 15 gives 5+y155 + y \geq 15, which simplifies to y10y \geq 10. Substituting it into the earnings inequality 4x+9y804x + 9y \geq 80 yields 20+9y8020 + 9y \geq 80, which simplifies to y6.67y \geq 6.67. To satisfy both conditions, the value of yy must be at least 10.

Step-by-Step Solution

1
Set up the inequalities for the system.
Let xx represent the number of small prints and yy represent the number of large prints. The constraint for the minimum number of prints is x+y15x + y \geq 15. The constraint for the minimum earnings is 4x+9y804x + 9y \geq 80.
To represent the given conditions as a system of linear inequalities in two variables.
2
Substitute the known value of small prints (x=5x = 5) into the inequalities.
Substituting x=5x = 5 into the first inequality gives 5+y155 + y \geq 15, which simplifies to y10y \geq 10. Substituting x=5x = 5 into the second inequality gives 4(5)+9y804(5) + 9y \geq 80, which simplifies to 20+9y8020 + 9y \geq 80, then 9y609y \geq 60, resulting in y2036.67y \geq \frac{20}{3} \approx 6.67.
To determine the range of values for the number of large prints (yy) under both constraints.
3
Determine the minimum integer value for yy that satisfies both inequalities.
The first constraint requires y10y \geq 10, and the second constraint requires y6.67y \geq 6.67. Since the number of prints must be an integer and both conditions must be satisfied, the minimum value is 1010.
To satisfy both inequalities simultaneously with the smallest possible integer value.

Key Concept

Systems of Linear Inequalities in Two Variables
Estimated Time:1m 0s
Question 20Question

A company plans to install standard-charging ports and fast-charging ports at its office building. The company must install at least 1515 charging ports in total. Each fast-charging port requires 1212 kilowatts of power, and each standard-charging port requires 44 kilowatts of power. The electrical grid can supply a maximum of 120120 kilowatts of power for these ports. Additionally, the number of standard-charging ports must be at least twice the number of fast-charging ports. What is the maximum number of fast-charging ports the company can install?

Show answer & explanation

Answer: 6

Answer

The maximum number of fast-charging ports the company can install is 6.
Representing the number of fast-charging ports by xx and standard-charging ports by yy yields the system of inequalities: x+y15x + y \geq 15, 12x+4y12012x + 4y \leq 120, and y2xy \geq 2x. The power constraint simplifies to 3x+y303x + y \leq 30, or y303xy \leq 30 - 3x. Combining this with y2xy \geq 2x gives 2x303x2x \leq 30 - 3x, which simplifies to 5x305x \leq 30, or x6x \leq 6. Substituting x=6x = 6 into the constraints gives y=12y = 12, which satisfies the total port constraint because 6+12=18156 + 12 = 18 \geq 15. Therefore, the maximum number of fast-charging ports is 6.

Step-by-Step Solution

1
Define variables and write the system of inequalities representing the constraints.
Let xx be the number of fast-charging ports and yy be the number of standard-charging ports. The constraints are:
1) x+y15x + y \geq 15
2) 12x+4y12012x + 4y \leq 120
3) y2xy \geq 2x
4) x0,y0x \geq 0, y \geq 0
This translates the word problem constraints into a system of linear inequalities.
2
Simplify the power capacity inequality.
3x+y303x + y \leq 30, which can be rewritten as y303xy \leq 30 - 3x.
Dividing the terms by 4 simplifies the coefficients, making algebraic manipulation easier.
3
Combine the simplified inequality with the charging port ratio constraint to find the upper limit for xx.
Since 2xy2x \leq y and y303xy \leq 30 - 3x, we have 2x303x2x \leq 30 - 3x.
Adding 3x3x to both sides yields 5x305x \leq 30.
Dividing by 5 gives x6x \leq 6.
This determines the maximum possible value for the number of fast-charging ports.
4
Verify that the upper limit x=6x = 6 satisfies all system constraints with integer values.
If x=6x = 6, then y2(6)=12y \geq 2(6) = 12 and y303(6)=12y \leq 30 - 3(6) = 12, which means y=12y = 12.
Checking the total port constraint: x+y=6+12=18x + y = 6 + 12 = 18. Since 181518 \geq 15, the point (6,12)(6, 12) satisfies all constraints.
Since the number of ports must be integers, we must confirm that x=6x = 6 yields a valid integer coordinate (6,12)(6, 12) that lies within the feasible region.

Key Concept

Maximizing a variable under a system of linear inequalities in two variables.
Page 1 / 3Next
Systems of Linear Inequalities in Two Variables Practice Questions — SAT | Examkin