MediumGradient & optimization

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

At … we are making the largest of the distances … as…

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

At $p = \infty$ we are making the largest of the distances $d_{1}, d_{2}, d_{3}$ as small as possible. The best point for a $1, 1, 2$ right triangle is ____.

~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, #40

Stuck? A gentle nudge

No hints for this one.

Something off?

Workspace

Your working

Check your full solution

Attach photos of your pages (up to 3) or one PDF — or check what you typed above. Lemma reads the work and verifies the reasoning, not just the answer.

Your first check today doesn't need an account.

Your photos and PDFs are read once and not stored — only the transcription is kept.