Systems of Linear Inequalities - Math 1

The system of inequalities $y > 2x - 3$ , $y < -\frac{1}{2}x + 4$ , and $x > 1$ defines a triangular region. If the boundaries of this region were changed to include equality ( $\geq$ and $\leq$ ), how would the area of the region change?
Answer: The area would remain exactly the same since boundary lines have zero area In geometric terms, the area of a region is a measure of the two-dimensional space it occupies. Adding or removing boundary lines (which are one-dimensional) does not change the two-dimensional area measurement. The boundary lines have zero area themselves, so including them (changing from strict inequalities to non-strict inequalities) adds zero area to the region. The triangular region retains the same area whether the boundaries are included or excluded. Option A is incorrect because boundaries don't contribute area. Option C is incorrect because we're adding, not removing points. Option D is incorrect because the mathematical principle applies regardless of specific coordinates.
A system of inequalities has no solution. Which of the following could represent such a system?
Answer: $x + y \leq 5$ , $x + y \geq 8$ , $x \geq 0$ , $y \geq 0$ because parallel constraints create contradictory requirements When you encounter a system of inequalities with no solution, you're looking for constraints that create contradictory requirements—conditions that cannot be satisfied simultaneously. The correct answer is B because it contains two directly contradictory constraints: $x + y \leq 5$ and $x + y \geq 8$ . These require that the sum of x and y be both less than or equal to 5 AND greater than or equal to 8 at the same time, which is mathematically impossible. No point can satisfy both conditions. Let's examine why the other options are wrong. Choice A claims the system has no solution, but it actually does. The constraint $2x + 2y \geq 8$ simplifies to $x + y \geq 4$ , which is compatible with $x + y \leq 5$ —solutions exist where the sum is between 4 and 5. Choice C incorrectly states that perpendicular constraints cannot coexist. The constraints $x - y \leq 3$ and $x + y \geq 7$ actually do have solutions—try the point (5, 2). Choice D makes a similar error, claiming non-parallel constraints create impossibility, but these constraints can and do have a feasible region. The key insight is that constraints are contradictory only when they place mutually exclusive requirements on the same expression or create an empty feasible region. Look for direct contradictions like "something ≤ a AND something ≥ b" where a < b, rather than assuming different-looking constraints automatically conflict.
Given the system $|x - 2| + |y - 1| \leq 3$ , $x + y \geq 4$ , which describes the intersection of these constraints?
Answer: A diamond-shaped region centered at $(2, 1)$ intersected with the half-plane above $x + y = 4$ When you encounter systems involving absolute value inequalities and linear inequalities, you're working with geometric regions in the coordinate plane. Each constraint defines a specific shape, and you need to find their intersection. The constraint $|x - 2| + |y - 1| \leq 3$ represents all points whose Manhattan distance (sum of horizontal and vertical distances) from $(2, 1)$ is at most 3. This creates a diamond (square rotated 45°) centered at $(2, 1)$ with vertices at $(5, 1)$ , $(2, 4)$ , $(-1, 1)$ , and $(2, -2)$ . You can verify this by testing these boundary points in the equation $|x - 2| + |y - 1| = 3$ . The constraint $x + y \geq 4$ represents the region above and including the line $x + y = 4$ . When $x + y = 4$ , you're on the boundary line; when $x + y > 4$ , you're above it. Now examining the wrong answers: Choice A incorrectly identifies the first region as a square rather than a diamond, and places it below the line instead of above. Choice B mistakes the diamond for a circular region and correctly identifies the half-plane. Choice D correctly identifies the diamond shape but incorrectly places the intersection below the line $x + y = 4$ instead of above it. The correct answer is C because we have a diamond-shaped region intersected with the half-plane above $x + y = 4$ . Study tip: Always sketch both constraints separately first, then find their overlap. Remember that $|x - h| + |y - k| \leq r$ always creates a diamond, not a circle.
The vertices of a feasible region are $(1, 2)$ , $(4, 1)$ , $(3, 5)$ , and $(0, 4)$ . If the objective function is $f(x, y) = ax + by$ where $a > 0$ and $b < 0$ , which vertex is most likely to optimize the function?
Answer: $(4, 1)$ because it maximizes $x$ and minimizes $y$ , aligning with the signs of the coefficients When you encounter linear programming optimization problems, the key insight is that the optimal value of a linear objective function always occurs at a vertex of the feasible region. The challenge is determining which vertex based on the coefficients' signs. For the objective function $f(x, y) = ax + by$ with $a > 0$ and $b < 0$ , you want to maximize the positive $ax$ term and minimize the negative impact of the $by$ term. Since $a > 0$ , larger $x$ -values increase the function value. Since $b < 0$ , smaller $y$ -values actually increase the function value (because you're adding a less negative number). Looking at vertex $(4, 1)$ , it has the maximum $x$ -coordinate (4) and minimum $y$ -coordinate (1) among all vertices. This perfectly aligns with what we need: maximize $x$ and minimize $y$ . Answer B correctly identifies this reasoning. Answer A incorrectly suggests minimizing $x$ and maximizing $y$ , which would actually minimize the function since this works against both coefficient signs. Answer C falls into the trap of thinking larger coordinate values are always better, ignoring that $b < 0$ makes large $y$ -values detrimental. Answer D incorrectly assumes the geometric center is optimal, but linear functions optimize at vertices, not interior points. Study tip: Always match the signs of your coefficients with your coordinate strategy. Positive coefficients want large coordinates; negative coefficients want small coordinates. The optimal vertex satisfies both conditions simultaneously.
A feasible region is defined by $2x + 3y \leq 18$ , $x + y \geq 4$ , $x \geq 0$ , and $y \geq 0$ . If the point $(3, 4)$ is tested against this system, what can be concluded?
Answer: The point is on the boundary of the feasible region because it satisfies $2x + 3y = 18$ Check each constraint for point $(3, 4)$ : (1) $2x + 3y \leq 18$ : $2(3) + 3(4) = 6 + 12 = 18 \leq 18$ ✓ (equality, so on boundary). (2) $x + y \geq 4$ : $3 + 4 = 7 \geq 4$ ✓. (3) $x \geq 0$ : $3 \geq 0$ ✓. (4) $y \geq 0$ : $4 \geq 0$ ✓. Since the point satisfies all constraints and achieves equality for $2x + 3y \leq 18$ , it lies on the boundary of the feasible region, not in the interior. Option A is incorrect because it ignores the fourth constraint and doesn't recognize the boundary condition. Option B contains a calculation error. Option D is incorrect because boundary points are not considered 'in' the region in the strict sense.
Consider the system of inequalities: $y \geq -2x + 6$ , $y \leq x + 1$ , and $x \geq 0$ . Which statement about the solution set is correct?
Answer: The feasible region is a triangle with vertices at $(0, 1)$ , $(0, 6)$ , and $\left(\frac{5}{3}, \frac{8}{3}\right)$ To find the feasible region, we need to determine where all three inequalities are satisfied simultaneously. First, find the intersection points: (1) y = -2x + 6 and y = x + 1: -2x + 6 = x + 1, so -3x = -5, giving x = 5/3 and y = 8/3. (2) x = 0 and y = x + 1: (0, 1). (3) x = 0 and y = -2x + 6: (0, 6). The feasible region is bounded by these three lines, forming a triangle with vertices at (0, 1), (0, 6), and (5/3, 8/3). Choice B has the coordinates reversed. Choice C is incorrect because the region is bounded. Choice D is wrong because the constraints do intersect.
In a system of inequalities, the feasible region is unbounded in the first quadrant. The constraints include $x + 2y \geq 6$ , $2x + y \geq 8$ , $x \geq 0$ , and $y \geq 0$ . Which statement best describes the nature of this feasible region?
Answer: The region extends infinitely in the positive x and y directions beyond a certain bounded area The constraints $x + 2y \geq 6$ and $2x + y \geq 8$ define half-planes that, combined with $x \geq 0$ and $y \geq 0$ , create a feasible region in the first quadrant. To find the intersection of $x + 2y = 6$ and $2x + y = 8$ : From the first equation, $x = 6 - 2y$ . Substituting: $2(6 - 2y) + y = 8$ , so $12 - 4y + y = 8$ , giving $12 - 3y = 8$ and $y = \frac{4}{3}$ . Then $x = 6 - 2(\frac{4}{3}) = \frac{10}{3}$ . The feasible region includes all points above and to the right of both constraint lines, which means it extends infinitely in the positive x and y directions beyond this vertex point. The region is unbounded because there are no upper limits on x or y values.
Two systems of linear inequalities, System A and System B, have feasible regions $R_A$ and $R_B$ respectively. If $R_A \cap R_B = \emptyset$ (empty intersection), which statement about their constraint boundaries must be true?
Answer: At least one constraint boundary from each system must create a separation that prevents any common feasible points If two feasible regions have an empty intersection (RA ∩ RB = ∅), it means there are no points that satisfy both systems simultaneously. This can happen in various ways: the regions could be separated by distance, have contradictory parallel constraints, or have any configuration where no overlap exists. Choice D correctly captures this general requirement - there must be some constraints that create a separation preventing common feasible points. Choice A is too specific; parallel lines with contradictory directions are sufficient but not necessary (regions can be disjoint in other ways). Choice B is incorrect because not all constraints need to be opposites. Choice C is wrong because the boundary lines don't need to be identical - they just need to create non-overlapping regions.
A linear programming problem has constraints forming a feasible region with exactly three vertices. If one constraint is removed, which outcome is impossible?
Answer: The feasible region gains exactly four additional vertices, expanding the triangular region significantly When a constraint is removed from a system that creates a triangular feasible region (3 vertices), the region can only expand, never contract (except to become empty). A triangle is formed by exactly 3 constraints. Removing one constraint can: (A) make the region unbounded if the removed constraint was a boundary, (B) add vertices if the removed constraint was cutting off part of what would otherwise be a larger polygon, or (C) make the region empty if the removed constraint was essential for the feasibility of the intersection. However, removing a single constraint from a triangle cannot add exactly 4 vertices. At most, removing one constraint can reveal 2 additional vertices (making a pentagon), but adding 4 vertices would require the original triangle to have been a much more complex shape artificially reduced to 3 vertices by one constraint, which is geometrically impossible in 2D.
A linear programming problem has the objective function $P = 3x + 4y$ subject to the constraints $x + y \leq 8$ , $2x + y \leq 12$ , $x \geq 0$ , and $y \geq 0$ . At which vertex of the feasible region does the maximum value of $P$ occur?
Answer: $(0, 8)$ with maximum value $P = 32$ First, find the vertices of the feasible region: (1) $(0, 0)$ : intersection of $x = 0$ and $y = 0$ . (2) $(0, 8)$ : intersection of $x = 0$ and $x + y = 8$ . (3) $(6, 0)$ : intersection of $y = 0$ and $2x + y = 12$ . (4) $(4, 4)$ : intersection of $x + y = 8$ and $2x + y = 12$ . Solving: $2x + y = 12$ and $x + y = 8$ gives $x = 4, y = 4$ . Evaluate $P = 3x + 4y$ at each vertex: At $(0, 0)$ : $P = 0$ . At $(0, 8)$ : $P = 32$ . At $(6, 0)$ : $P = 18$ . At $(4, 4)$ : $P = 28$ . Maximum occurs at $(0, 8)$ with $P = 32$ .
A system of inequalities defines a feasible region in the first quadrant. The region is bounded by $x + 2y \leq 12$ , $3x + y \leq 15$ , $x \geq 0$ , and $y \geq 0$ . If a point $(a, b)$ is in the interior of this feasible region, which of the following must be true about the point $(a + 1, b + 1)$ ?
Answer: Its location relative to the feasible region cannot be determined If $(a, b)$ is in the interior, then $a + 2b < 12$ and $3a + b < 15$ with $a > 0, b > 0$ . For $(a+1, b+1)$ : we need $(a+1) + 2(b+1) = a + 2b + 3$ and $3(a+1) + (b+1) = 3a + b + 4$ . Since $a + 2b < 12$ , we have $a + 2b + 3 < 15$ but we need $a + 2b + 3 \leq 12$ or $a + 2b < 9$ . Similarly for the other constraint. The location depends on how close $(a,b)$ is to the boundaries, so we cannot determine the location of $(a+1, b+1)$ without more information.
A company has two production lines with constraints $2x + y \leq 16$ , $x + 3y \leq 18$ , $x \geq 2$ , and $y \geq 1$ . If the objective is to minimize the cost function $C = 3x + 2y$ , which vertex of the feasible region yields the minimum cost?
Answer: $(2, 1)$ with a minimum cost of $8$ because it's the closest to the origin To minimize the cost function, we need to find all vertices of the feasible region and evaluate C = 3x + 2y at each. The constraints are: 2x + y ≤ 16, x + 3y ≤ 18, x ≥ 2, y ≥ 1. Finding vertices: (1) Intersection of x = 2 and y = 1: (2, 1). Check: 2(2) + 1 = 5 ≤ 16 ✓, 2 + 3(1) = 5 ≤ 18 ✓. (2) Intersection of x = 2 and x + 3y = 18: 2 + 3y = 18, so y = 16/3 ≈ 5.33. Point: (2, 16/3). Check: 2(2) + 16/3 = 4 + 5.33 = 9.33 ≤ 16 ✓. (3) Intersection of 2x + y = 16 and x + 3y = 18: From 2x + y = 16, y = 16 - 2x. Substituting: x + 3(16 - 2x) = 18, so x + 48 - 6x = 18, giving -5x = -30, so x = 6 and y = 4. Point: (6, 4). (4) Intersection of 2x + y = 16 and y = 1: 2x + 1 = 16, so x = 7.5. Point: (7.5, 1). Check: 7.5 + 3(1) = 10.5 ≤ 18 ✓. Evaluating C = 3x + 2y: At (2, 1): C = 6 + 2 = 8. At (2, 16/3): C = 6 + 32/3 ≈ 16.67. At (6, 4): C = 18 + 8 = 26. At (7.5, 1): C = 22.5 + 2 = 24.5. The minimum cost is 8 at (2, 1).

Start this quiz