Maximize or minimize subject to a constraint: ∇f = λ∇g. 70 problems with worked solutions; in 70 of them every
equation is proved by a computer algebra system.
3 worked problems
Try each one before opening the solution. Every line is labeled with what checked it. How we verify
A contour map of f(x, y) = 4x + y: each curve joins points where f has the same value. The constraint circle of radius 5 is drawn over it; the largest and smallest values on the circle are where a level line just touches it.
✓ Nihil obstat Lines: 2 proved, 3 reviewed. The answer was also checked a second way, without looking at the solution. Reviewers found nothing wrong with the explanation. The full receipt ·
How we verify
A contour map of f(x, y) = 2x + 3y: each curve joins points where f has the same value. The constraint circle of radius 2 is drawn over it; the largest and smallest values on the circle are where a level line just touches it.
✓ Nihil obstat Lines: 2 proved, 3 reviewed. The answer was also checked a second way, without looking at the solution. Reviewers found nothing wrong with the explanation. The full receipt ·
How we verify
A contour map of f(x, y) = x + 4y: each curve joins points where f has the same value. The constraint circle of radius 3 is drawn over it; the largest and smallest values on the circle are where a level line just touches it.
✓ Nihil obstat Lines: 2 proved, 3 reviewed. The answer was also checked a second way, without looking at the solution. Reviewers found nothing wrong with the explanation. The full receipt ·
How we verify