Lagrange's Milkmaid Problem

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

This Demonstration visualizes a classical example of constrained optimization using a Lagrange multiplier.


In the milkmaid problem [1], a milkmaid walks from her home at to the river at the point , draws a bucket of water, and brings it to the cow at . The problem seeks to minimize the total distance traveled, .

Use the slider to change the course of the river and drag the locators to change the positions of the maid and the cow. The red dashed arrows mark the path with minimal distance.

The curves of constant distance from to via a variable point are ellipses with and as focal points. At the point on the river where the distance is minimized, there must be a common tangent to the river and the ellipse of the minimal distance.


Contributed by: Erik Mahieu (November 2013)
Open content licensed under CC BY-NC-SA




[1] S. Jensen. "An Introduction to Lagrange Multipliers." (2011)

[2] A. Segalla and S. Watson, "The Flip-Side of a Lagrange Multiplier Problem," The College Mathematics Journal, 36(3), 2005 pp. 232–235.

Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.