MediumGradient & optimization

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

With four points in a plane, the Steiner problem allows branches (Figure…

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

With four points in a plane, the Steiner problem allows branches (Figure 13.18c). Find the shortest network connecting the corners of a rectangle, if the side lengths are (a) 1 and 2 (b) 1 and 1 (two solutions for a square) (c) 1 and 0.1.

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

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.