- Difficulty
- Challenging
- Suggested time
- 6 min
- Marks
- 3
Optimization in two variables and Lagrange multipliers practice question 9
A bakery’s daily output is trays, where is hours of baker time at $25 an hour and is hours of oven time at $16 an hour. It must make 40 trays a day. Use Lagrange multipliers to find the least daily cost of doing so.
Which quantity is to be made as small as possible, and which is held fixed? Write each in terms of the hours and .
Minimise subject to . Here and .
Dividing by gives . Combine that with .
A whole number of dollars.
Theory UBC Math 100 §16.3Key results
Worked solution
Strategy
Cost is the objective and the output target is the constraint. The Lagrange conditions fix the ratio of the two inputs, and the target then fixes their sizes.
Working
C_x = λg_x and C_y = λg_y with g = 2√(xy), plus the target.
Divide the first equation by the second; λ cancels.
The target 2√(xy) = 40 means xy = 400. Keep the positive root.
Along xy = 400 the cost grows without bound as either input shrinks toward 0, so this single candidate is the minimum.
Answer
The answer is $800 a day, using 16 hours of baker time and 25 hours of oven time.
Check
Other ways to make 40 trays cost more: 20 hours of each costs $820, and 10 baker hours with 40 oven hours cost $890.
Where this goes wrong
Dividing the conditions the wrong way round, so that y/x = 16/25. That gives x = 25 and y = 16, which still makes 40 trays but costs $881. A quick check: the cheaper input, oven time, should be used more.
Leans on
The chain rule on a square root, from The chain rule and logarithms
Saved in this browser only.