10176

# Graphical Illustration of Bivariate Constrained Optimization

This Demonstration illustrates graphically finding a constrained extrema of a function of two variables with a constraint . In this Demonstration . While the brown point moves on the unit circle, the cyan point moves on the curve, which is the intersection of the surface that is the graph of the function and the cylinder given by .

### DETAILS

To find the extrema of a function , subject to the constraint that , form an auxiliary function . The coordinates of the extrema satisfy three equations: , , and =0. The function is referred to as the Lagrangian, and as the Lagrange multiplier. One observes that the first of the three equations is simply , and that we really have three variables , so the system we solve is not overdetermined. This method assumes that the constraint equation defines a smooth (differentiable) closed curve, so that no points require special testing.

### PERMANENT CITATION

 Share: Embed Interactive Demonstration New! Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details » Download Demonstration as CDF » Download Author Code »(preview ») Files require Wolfram CDF Player or Mathematica.

#### Related Topics

 RELATED RESOURCES
 The #1 tool for creating Demonstrations and anything technical. Explore anything with the first computational knowledge engine. The web's most extensive mathematics resource. An app for every course—right in the palm of your hand. Read our views on math,science, and technology. The format that makes Demonstrations (and any information) easy to share and interact with. Programs & resources for educators, schools & students. Join the initiative for modernizing math education. Walk through homework problems one step at a time, with hints to help along the way. Unlimited random practice problems and answers with built-in Step-by-step solutions. Practice online or make a printable study sheet. Knowledge-based programming for everyone.