MediumGradient & optimization

Gilbert Strang, Calculus, 3rd edition (Wellesley-Cambridge Press; MIT OpenCourseWare RES.18-001) §13.6 Maxima, Minima, and Saddle Points, #34 · Multivariable Calculus · Gradient & optimization

Suppose one side of the triangle goes from … to

These problems minimize the Steiner distance $f = d_{1} + d_{2} + d_{3}$ and related functions. A computer is needed for 33 and.

Suppose one side of the triangle goes from $(- 1, 0)$ to $(1, 0)$ . Above that side are points from which the lines to $(- 1, 0)$ and $(1, 0)$ meet at a $12 0^{\circ}$ angle. Those points lie on a circular arc—draw it and find its center and its radius.

~8 minWritten answer · check your work with Lemma

Gilbert Strang, Calculus, 3rd edition (Wellesley-Cambridge Press; MIT OpenCourseWare RES.18-001) · §13.6 Maxima, Minima, and Saddle Points, #34

Stuck? A gentle nudge

No hints for this one.

Something off?

Workspace

Your working

Check your full solution

Upload photos of your handwritten work or a PDF, and Lemma will read it and tell you whether it's right — and where it first goes wrong if not.