Systems of Inequalities: Core practice
10 practice problems for this lesson. Work on paper, use hints when you need them, and check the answer or the full solution when you are ready.
Difficulty: Core (core-course level)
0 of 10 completed · 0 skipped
Progress saved in this browser.
Progress can't be saved in this browser, so your choices last for this visit only.
-
Problem 1 A shaded half-plane
The figure shows a shaded half-plane. Write its defining inequality.
The boundary and its shaded side. Text description of this figure
A grid with the horizontal axis labeled x and the vertical axis labeled y, both from -3 to 3, gridlines and number labels at every whole number, and the origin labeled 0. A dashed line runs through the labeled points (0, 1) and (1, -1), extending to the edges of the grid. The side of the line containing the origin is shaded; the origin itself is not marked. No inequality or equation is written on the figure.
- Hint 1
Use two points on its boundary to find the line.
- Hint 2
Use an interior point and the boundary style to choose the symbol.
Answer
, or .
Full solution
The boundary passes through and , giving slope and line .
The shaded point lies below this line.
The line is dashed, so its points are excluded.
Answer
, or .
Key idea
A boundary equation, a shaded side, and inclusion information determine a half-plane.
- Hint 1
-
Problem 2 A boundary choice
On the blank coordinate grid in the figure, graph and together.
A blank coordinate grid for the two boundaries. Text description of this figure
A grid with the horizontal axis labeled x running from -4 to 4 and the vertical axis labeled y running from -4 to 4, gridlines and number labels at every whole number, and the origin labeled 0. No point, boundary, or shading is drawn.
- Hint 1
Each condition keeps one side of a horizontal or vertical line.
- Hint 2
The equality signs decide which of the two boundaries is included.
Answer
The overlap is right of the solid line and below the dashed line .
Full solution
The condition includes its vertical boundary and all points to its right.
The condition excludes its horizontal boundary and keeps the lower side.
A point such as passes both tests.
Shade their overlap.
Answer
The overlap is right of the solid line and below the dashed line .
Key idea
A system keeps only points accepted by every inequality.
- Hint 1
-
Problem 3 A fixed horizontal slice
For the system and , determine all real allowed on the horizontal line .
- Hint 1
The chosen height turns both conditions into one-variable inequalities.
- Hint 2
Find the overlap of the resulting upper bounds on .
Answer
, or .
Full solution
Substitute in both conditions.
These require and .
Their overlap is .
At , both original inequalities hold.
Answer
, or .
Key idea
A horizontal slice of a feasible region is found by fixing its height in every condition.
- Hint 1
-
Problem 4 A bounded patch
On the blank grid in the figure, graph , , , and . Give every corner of the feasible region.
A blank coordinate grid for the region. Text description of this figure
A grid with the horizontal axis labeled x running from -1 to 7 and the vertical axis labeled y running from -1 to 7, gridlines and number labels at every whole number, and the origin labeled 0. No point, boundary, or shading is drawn.
- Hint 1
Intersect all four allowed sides before keeping a boundary crossing.
- Hint 2
Check each crossing against the inequalities it did not come from.
Answer
Corners: , , , ; all edges solid.
Full solution
The lines and give .
Intersecting and gives .
For the slanted pair,
This gives .
Finally and give .
All pass all four conditions.
The crossing fails and is discarded, and the crossing from and fails and is also discarded.
Every boundary includes equality, so all edges are solid.
Answer
Corners: , , , ; all edges solid.
Key idea
A boundary crossing is a corner only if it satisfies the whole system.
- Hint 1
-
Problem 5 A cooling schedule
A cooling system runs two modes for real durations and hours. It requires , , , and . Cooling output is units. Find the greatest output and the durations achieving it.
- Hint 1
The linear output can be evaluated at the corners of the allowed region.
- Hint 2
Find the intersections of the four boundaries and keep the feasible ones.
Answer
Maximum 22 units at hour and hours.
Full solution
Intersect the boundaries in pairs. with gives ; with gives ; with gives ; with gives .
The remaining pair, and , gives , which fails and is discarded.
The region is bounded with solid boundaries.
Evaluate each of the four kept corners.
The largest output is 22 units.
The schedule satisfies all four conditions.
Answer
Maximum 22 units at hour and hours.
Key idea
A linear objective on a bounded region with solid boundaries reaches its best value at a corner.
- Hint 1
-
Problem 6 A slanted strip
Find the minimum and maximum of subject to and . State where each is attained.
- Hint 1
An extremum of a linear expression over a bounded region with solid boundaries occurs at one of its corners.
- Hint 2
Find the region's four corners, then evaluate at each.
Answer
Minimum at ; maximum at .
Full solution
The region is a parallelogram cut by and : at the strip runs from to , and at from to , giving the four corners , , , .
The smallest value is and the largest is .
Both corner points satisfy all the constraints.
Answer
Minimum at ; maximum at .
Key idea
A strip cut off at two inputs can form a bounded region with both extrema.
- Hint 1
-
Problem 7 Resource requirements
A process requires real amounts , together with , , and . Determine whether any allowed amounts exist and whether has an optimum there.
- Hint 1
Use the upper bounds to estimate the largest possible left side of the requirement.
- Hint 2
Compare that bound with the required minimum.
Answer
The region is empty; no minimum or maximum exists.
Full solution
The upper bounds imply
This contradicts .
Thus no point is allowed, and there is nowhere to evaluate an objective.
Answer
The region is empty; no minimum or maximum exists.
Key idea
Separate upper bounds can make a combined minimum requirement impossible.
- Hint 1
-
Problem 8 Points between two choices
Two points and satisfy . A student claims their midpoint also satisfies it. Is this correct? Justify without assuming where the points lie.
- Hint 1
The midpoint averages the two coordinates.
- Hint 2
Evaluate the linear expression at the averaged coordinates.
Answer
Yes; the midpoint satisfies the inequality.
Full solution
Write and ; the hypotheses are and .
Their midpoint is , so twice its first coordinate plus its second coordinate is
The numerator is at most , so the value is at most .
Answer
Yes; the midpoint satisfies the inequality.
Key idea
Averaging two accepted points preserves a linear inequality.
- Hint 1
-
Problem 9 A claimed maximum
For and , a student says has a maximum of at . Is this correct? Explain.
- Hint 1
Check whether the proposed maximizing point belongs to the region.
- Hint 2
For any allowed height, consider a slightly larger height still below the boundary.
Answer
No; no maximum exists, although approaches .
Full solution
The point is excluded because .
Every allowed point has .
At , values of can approach from below, so approaches .
For any allowed , the new height is larger and still below , increasing .
Answer
No; no maximum exists, although approaches .
Key idea
A missing boundary can prevent a bounded objective from attaining its upper bound.
- Hint 1
-
Problem 10 An unbounded direction
The region is and . Does have both a maximum and a minimum even though the region is unbounded? Explain and describe where they occur.
- Hint 1
Consider which coordinate direction is unbounded, and whether the objective depends on that direction.
- Hint 2
Check which coordinate the objective actually measures.
Answer
Yes; minimum at and maximum at , for all .
Full solution
The region extends indefinitely as increases.
However,
Both bounding heights are included.
Every point with attains the minimum, and every point attains the maximum.
Answer
Yes; minimum at and maximum at , for all .
Key idea
An unbounded region can still bound an objective that ignores its unbounded direction.
- Hint 1