6347: Optimizing For Two Variables

From SRoMG Explained
(Redirected from 6347)
Jump to navigationJump to search
Optimizing For Two Variables

Made by: Lubaf


Explanation[edit | edit source]

This strip reworks the sunset from the original Garfield strip, which Garfield spent thirty seconds admiring, into a thermonuclear explosion that kills thirty million people, with the author's notes explaining advanced calculus points.

A thermonuclear explosion that kills thirty million people witnessable from an unaffected Muncie, Indiana, where Garfield is set, would have to be very large in radius, with at least one major city fairly near Muncie (such as Chicago, Indianapolis, Cleveland, or Detroit) and its corresponding metropolitan area being on an outer edge of the explosion, and multiple other major metropolitan areas undoubtedly included in the blast radius; the blast radius itself may vary in size based on the populations of the major metropolitan areas needed to be covered in order to kill thirty million people.

The author writes:[edit | edit source]

As anybody who's been through Calculus knows, it's effectively impossible to truly optimize for two or more result variables (known as "Bicriteria optimization" for the 2 variable case) unless you count what are known as "Pareto-optimal" points, where no gain in any possible result can be found without a reduction in another. In this strip of SRoMG, I think I may have succeeded in finding such a point, but only by optimizing for the maximum Stupid and Dark variables (the combination of which is sometimes known as "Grimderp").

Original strip: 2023-03-02.

Transcript[edit | edit source]

Garfield {in front of an orange glow, smiling}: What a beautiful thermonuclear explosion!
{Beat panel}
Garfield {turning away}: Well, that killed thirty million people...