Practise one decision at a time: describe the feasible set, choose substitution or Lagrange multipliers, keep every case and justify the extremum. All variables and objective values below are real and dimensionless. These are original learning questions, not a Concordia assessment. They support later-course MAST 218 topics; use your own section outline for timing and assessment scope.
Try each question before opening its hint or solution. After checking the reasoning, solve the retry without looking back. For the full method, use Constrained optimization: from feasible points to justified extrema.
1. A minimum on an unbounded line
Find the global extrema of subject to . State the feasible set and give both the value and location of every extremum that exists. Verify the candidate using Lagrange multipliers.
Hint
Write . What values may take? Complete the square before deciding whether a maximum exists.
Explained solution
The feasible set is the whole line, so . Substitution gives
Thus the unique global minimum is at . As , , so there is no global maximum. The line is unbounded, but that does not prevent a minimum.
For , . The equations
give , hence , . Check the original constraint: . Check the objective: . The completed square supplies the global proof.
Retry: keep only nonnegative coordinates
Keep the same objective and add , . What changes?
Retry solution
Now . The only interior stationary point remains . At the endpoints, and . Comparing these with gives the same unique minimum at and a global maximum of at . The maximum exists because the endpoints restrict how far along the line you may go.
Deeper explanation: substitution and the allowed interval.
2. Both extrema on a circle
Find the global extrema of on . Why is comparing all regular multiplier candidates enough here?
Hint
Use . Can be zero? Check that your points lie on the circle.
Explained solution
The circle is nonempty, closed and bounded, and is continuous. Both global extrema exist. The constraint gradient is nonzero everywhere on the circle, which has no endpoints.
The equations are
Here is impossible because the first equation would give . Thus and . The constraint becomes , so .
The candidates are , with value , and , with value . They give the global maximum and minimum respectively. Every possible global extremum must satisfy these candidate equations, and every solution has been checked.
Independent check: Cauchy–Schwarz gives , with equality at exactly these aligned or oppositely aligned points.
Retry: replace the circle by an open disk
Now use . Do the same extreme values occur?
Retry solution
For every feasible point, ; neither boundary point is allowed. For , the points give as , and give . Therefore the supremum is and the infimum is , but neither is attained. There is no global maximum or minimum. A supremum is the least upper bound; an infimum is the greatest lower bound. They need not be values at feasible points.
Deeper explanation: existence and feasible sets.
3. Keep every candidate on an ellipse
Find all points of global maximum and minimum of subject to .
Hint
Use and . Check zero-coordinate cases before cancelling. Relate and without choosing signs too early.
Explained solution
The ellipse is compact, and is never zero on it. Both global extrema exist and must appear among the regular candidates.
If , the first multiplier equation forces , which is infeasible. Similarly cannot be a candidate. Multiplying the first equation by and the second by yields
so . The constraint then gives , or , and .
The global maximum is at and . The global minimum is at and . All four satisfy the constraint and multiplier equations; same signs give , opposite signs give .
Independent check: and , together with the constraint, imply . The listed points attain the two bounds.
Retry: change only the objective
On the same ellipse, optimize .
Retry solution
The constraint itself gives at every feasible point. Thus the global maximum and minimum are both , each attained everywhere on the ellipse. They are not strict extrema. With , the equations hold at every point for . A candidate set need not be a finite list.
Deeper explanation: multiple candidates on a compact constraint.
4. Do not drop the interior of a disk
Find the global extrema of on . Give separate interior and boundary candidate lists, then compare them.
Hint
Inside the disk, use . On the circle, use the constraint to rewrite , or solve the multiplier equations while keeping zero-coordinate cases.
Explained solution
Continuity on the closed disk guarantees both global extrema. In the interior, gives the feasible point , with value .
On the boundary, , so . Its boundary minimum is at , and its boundary maximum is at .
For completeness, the boundary multiplier equations are
If both coordinates were nonzero, the first equation would give and the second , impossible. If , the candidates are ; if , they are . Both cannot be zero on the circle. No boundary cases are missing.
Comparing the five points gives the unique global minimum at and global maximum at both and . A direct bound checks the result: , with the stated equality cases. The boundary minimum is not the minimum on the disk.
Retry: keep only the boundary
Replace the inequality by .
Retry solution
The origin is now infeasible. The global minimum is at ; the global maximum remains at . The objective did not change, but the feasible set did.
Deeper explanation: interior and boundary comparisons.
5. Diagnose a constraint-gradient failure
Optimize subject to . A student obtains no Lagrange candidates and says there can be no extrema. Identify the failed hypothesis, then solve the problem.
Hint
Which set does the squared equation describe? Compute its gradient on that set. Can the same set be represented by a regular equation?
Explained solution
The feasible set is exactly the unit circle. If , then
at every feasible point. Since , the equations have no solutions. The regularity hypothesis has failed everywhere; those equations are not a necessary condition here.
Use the equivalent regular constraint . Now , so and . The constraint gives . The continuous objective on the compact circle therefore has maximum at and minimum at . The bound provides an independent check.
Retry: a singular point that must be checked directly
Find the global extrema of on , without discarding the origin when the constraint gradient vanishes.
Retry solution
The feasible parametrization , , covers the whole cusp. Indeed, the constraint forces ; for , setting gives and , while the origin corresponds to .
Then , with equality only at . The unique global minimum is at ; there is no global maximum because as . For , vanishes at the origin, so it deserves a direct check even though it happens also to satisfy the multiplier equation for this objective.
Deeper explanation: singular constraints and representations.
6. A zero second derivative leaves a decision to make
Optimize on . Find the Lagrange candidate. A student checks the second derivative of the reduced function, gets zero and concludes “no minimum.” Repair that reasoning.
Hint
Write . A direct sign comparison can settle the problem even when the second-derivative test cannot.
Explained solution
The regular constraint has gradient . Lagrange gives
so the candidate is , with . Substitution gives
Thus , and the second-derivative test is inconclusive. However, , with equality only at . The unique global minimum is at . There is no global maximum because the fourth power is unbounded above. The inequality supplies the missing classification.
Retry: change the fourth power to a cube
Optimize on . Does the stationary point still give a minimum?
Retry solution
The candidate is again : , , . But the reduced function is . For every ,
Hence the candidate is neither a local minimum nor a local maximum along the line. As , the objective is unbounded in both directions, so there is no global extremum either. Again the second derivative at the candidate is zero; the sign comparison resolves what that test leaves open.
Deeper explanation: stationary candidates and inconclusive tests.
Review the reasoning you want to improve
- Missed a condition or an endpoint? Revisit the feasible set.
- Found a candidate but could not classify it? Use the conclusion checklist.
- Lost a zero-coordinate case? Rework question 4 without dividing by either coordinate.
For MAST 218 tutoring, bring your feasible-set sketch, full candidate list and the step where the conclusion became uncertain. We work through permitted practice and comparable examples, without completing graded assessments on your behalf.
Useful for
Work on the step you’re missing.
Tell us the subject and your preferred time. Nablio confirms the details by text or email.
Request a lesson