Example 4: on an unbounded region: no minimum
Determine graphically the minimum value of the objective function
subject to the constraints:
After its solution the book adds:
In the above example, can you say whether has the maximum value 100 at ? For this, check whether the graph of has points in common with the feasible region. (Why?)
(i) Draw the lines (graph):
through and ;
through and ;
through and .
At : is true, so shade towards the origin for (2); is false, so shade away from the origin for (3); is true, so shade towards the origin for (4). With , the feasible region (shaded) is unbounded.
The region is unbounded, so we check the open half-plane , i.e. . Draw the line dashed (graph), through and .
The point is feasible, as , , . It gives , so this half-plane has points in common with the feasible region.
has no minimum value.
(ii) The largest corner value is 100, at . As the region is unbounded, 100 is the maximum only if the open half-plane , i.e. , has no point in common with the region. That is why we check it.
On the region, (2) gives , and , so
So no feasible point has : the region lies on one side of the dashed line and meets it only at (graph).
has the maximum value 100 at .
Want the reason behind every step, the basics and the checks?
When the feasible region goes on for ever, the corner table alone cannot be trusted: may keep falling (or rising) as we move far out. The smallest corner value is the minimum only if no feasible point gives a smaller , that is, only if the open half-plane misses the region. Here it does not miss, so there is no minimum. For the maximum the test is , and that half-plane does miss the region, so the maximum is .
- Given
- and the constraints , , , , .
- To find
- (i) The minimum value of , if there is one. (ii) Whether has the maximum value 100 at , and why the half-plane is the thing to check.
- Plan
- Part (i): draw the three lines and choose their sides; shade the unbounded region; find its four corners; tabulate ; apply the open half-plane test to the smallest value. Part (ii): apply the same test to the largest value.
Basics you need
Draw from its axis points (an axis point may have a negative coordinate); test to choose the side. Basics: where a line meets the axes · Basics: which side
A region is bounded if a circle can be drawn round it; otherwise it is unbounded and goes on for ever in some direction. Basics: bounded or not
Corners are where two boundary lines meet; is worked out at each. Call the largest value and the smallest . Basics: a corner solves two equations
is the minimum of if the open half-plane has no point in common with the region; otherwise has no minimum. Likewise is the maximum if has no common point; otherwise there is no maximum. "Open" means the line itself is left out. Basics: lines of equal Z
Part (i): the minimum of
Draw the line and choose its side
Put : , so . Put : , so . The line joins and ; it also passes through .
Test in (2): is true, so (2) keeps the side of the line that contains the origin. In the first quadrant this is the side below the line: (2) says .
The -axis point is to the left of the origin, outside the first quadrant, but it still fixes the line. The test point needs care with the minus signs: , and is greater than .Draw the line and choose its side
Its axis points are and . Test in (3): is false, so (3) keeps the side away from the origin.
"At least 3" fails at the origin, so the kept side is the far one.Draw the line and choose its side
Put : . Put : , so . The line joins and ; it also passes through .
Test in (4): is true, so (4) keeps the origin's side, which is the side above the line: (4) says .
Again one axis point, , is outside the first quadrant. Rewriting (4) as (adding to both sides) shows directly that the kept side is above the line.Shade the feasible region: it is unbounded
In the first quadrant, the region lies below , beyond , and above . It is shaded below; the darker part and the dashed line are used in Part (i), Step 7.
The feasible region of Example 4 (shaded, drawn with equal scales). It has corners , , , and is open towards the top right. The dashed line is ; the darker part of the region lies in the open half-plane , where . It contains . The region is unbounded: every point with is in it (, , ), and these points go as far from O as we like, so no circle can enclose the region.
Between the two upward-sloping lines and there is a strip that keeps widening to the right, because the first line is steeper. Nothing closes it off, which is what "unbounded" means.Find the corner points
: line (2) meets the -axis. : line (3) meets the -axis. : line (3) meets the -axis. : line (4) meets the -axis. Each obeys every constraint; for example : , , .
No other crossing point is in the region. Lines (2) and (3) meet at , lines (2) and (4) at , lines (3) and (4) at : each has a negative coordinate. and are outside the first quadrant, and O breaks (3).
An unbounded region still has corners; it just also has edges that run off for ever (here along lines (2) and (4)). Checking all the crossing points makes sure the list of corners is complete.Work out at each corner
Corner point ← largest ← smallest So , at .
If the region were bounded, Theorem 2 would make the minimum at once. It is unbounded, so may or may not be the minimum, and the next step decides.The open half-plane test for
Following step 3(ii) of the Corner Point Method, we look at the open half-plane
(dividing by 10). Its boundary passes through and ; it is drawn dashed because the line itself is not included.
The feasible point is in this half-plane: , and indeed . So the half-plane has points in common with the feasible region (the darker part of the graph), and has no minimum value.
The half-plane contains exactly the points where is smaller than the best corner value. A feasible point there shows is not the smallest value. In fact has no smallest value at all: along the edge , at , , which falls below any number as grows. The book prints the two tests of step 3(ii) as items "4. (a)" and "4. (b)" just below step 3(ii); the test used here is the one for the minimum, (b), and the book's text of Example 4 points to it as step 3(ii) of the Corner Point Method.
Part (ii): the book's follow-up, and why the half-plane is checked
Why we check
The largest corner value is , at . Because the region is unbounded, this is not automatically the maximum: might be larger at some point far out in the region. The test of the Corner Point Method (printed as item 4(a), just below step 3(ii)) says: is the maximum if the open half-plane has no point in common with the feasible region; otherwise has no maximum value.
This answers the book's "(Why?)". The open half-plane is exactly the set of points where beats the best corner. If a feasible point lay in it, 100 would not be the maximum. If none does, then at every feasible point, and is actually reached at , so 100 is the maximum.Draw the half-plane
Dividing by 10, the half-plane is . Its boundary passes through and , and the half-plane is the side above and to the left of it (the origin gives , false).
The same feasible region (blue, equal scales) with the dashed line through and . The open half-plane , where , is the light rose side. It does not meet the region, which touches the dashed line only at . The dashed line is steeper (slope ) than the edge (slope 2), and both pass through . So to the right of the -axis the dashed line runs above the region's upper edge.Show that there is no common point
Every feasible point satisfies (2), that is , and . Hence
So never holds on the feasible region: the open half-plane has no point in common with it.
Multiplying by the positive number 2 keeps the direction. The graph suggests the answer; this one line of algebra proves it for the whole infinite region.Conclude
Yes: has the maximum value 100 at . Multiplying the last result by 10, at every feasible point, with equality only when and .
So on this unbounded region has a maximum but no minimum. Unboundedness only makes an optimum possible to lose; the half-plane test decides each case separately.
The feasible region is unbounded, with corners , , , , where .
(i) The smallest corner value is not a minimum, because the open half-plane meets the region: has no minimum value. (Textbook answer: has no minimum value subject to the given constraints.)
(ii) The open half-plane has no point in common with the region, so has the maximum value 100 at . (The book asks this as a question and does not print the answer.)
Along the edge : gives , gives , and gives . Each point is feasible, and each value fits with : there is no lowest value ✓.
For the maximum, : at , on the upper edge, ✓; at , ✓; at , ✓.
The corner itself lies on the dashed line : ✓, and lies on ✓.
- Stopping at the table. On an unbounded region, is only a candidate; the answer "minimum " is wrong here.
- Using a closed half-plane. The test uses , not . The corner itself gives , so a "" test would always find a common point.
- Sign slips with . At the origin is true, so the origin's side is kept.
- Deciding that an unbounded region has no maximum either. Part (ii) shows the maximum 100 exists; each test must be done.
- Unbounded region: make the table, then test for a minimum and for a maximum, using open half-planes drawn dashed.
- One feasible point in the open half-plane is enough to show there is no optimum of that kind.
- To show there is no common point, a line of algebra (or a clear graph) for the whole region is needed, as in Part (ii), Step 3. Example 5 shows the last case: no feasible region at all.
Every fact used, and where it comes from
| Fact | Used in | Source |
|---|---|---|
| A line from its axis points; a test point chooses the side | Part (i), Steps 1 to 3 | Class XI, Linear Inequalities (Basics, Basics) |
| Bounded: can be enclosed within a circle; otherwise unbounded | Part (i), Step 4 | Section 12.2.2, footnote to Theorem 2 (Basics) |
| Corner point: where two boundary lines meet | Part (i), Step 5 | Section 12.2.2, footnote to Theorem 1 (Basics) |
| Unbounded region: a maximum or minimum may not exist (Remark after Theorem 2) | Part (i), Step 6 | Section 12.2.2 |
| Open half-plane tests for and (printed as 4(a), 4(b) under step 3(ii)) | Part (i), Step 7; Part (ii), Step 1 | Corner Point Method, Section 12.2.2 (Lesson) |
| Multiplying an inequality by a positive number keeps its direction | Part (ii), Step 3 | Class XI, Linear Inequalities |
| Textbook working, answer and the "(Why?)" question | Result | Example 4, Section 12.2.2 |
| All values | Steps, Check | Recomputed with exact fractions in the site's verification script |
Tell us if something on this page is wrong or unclear, or if you would like a fuller explanation, another method or a new feature. Send feedback on this problem →