The Geometric Method: Optimization Scan

The Geometric Method: Optimization Scan Weight c₁ (x) 2.0 Weight c₂ (y) 1.5 Scan Objective Value ( z) 0.0 Objective Line Feasible Region Goal: Move the slider to find the highest z that still touches the blue region. Notice how the optimal solution always lands on a corner! The Geometric Method: Optimization Scan lets you explore this hands-on instead of only reading about it.

Solving 2D linear programming problems using geometric visualization, feasible regions, and level curves. It focuses on Feasible Region, Extreme Point Theorem, Level Curves, Vertices, Boundedness from the “Graphical Optimization and the Geometric Method” section.

The sliders change the key inputs. Every change updates the visualization in real time, so you can see exactly how each variable affects the outcome.

Math 354: Linear Optimization provides a comprehensive introduction to the mathematical theory and application of linear programming. The course covers the transition from foundational linear algebra concepts, such as m… This demo is the interactive piece for the “Graphical Optimization and the Geometric Method” section. Open the full Spring 2026 - Math 354 - Sections 02/04 course wiki at https://www.getlykke.com/explore/public/spring-2026-math-354-765743ab-3e83-4eb5-ac72-d0dd4db82581 for notes, flashcards, quizzes and the other demos.

You'll build intuition for Feasible Region, Extreme Point Theorem, Level Curves, Vertices, Boundedness — and, crucially, see how they behave when you change the inputs, which is hard to get from a textbook or lecture on Spring 2026 - Math 354 - Sections 02/04 alone.