Facility Location for a tax cut
Built for educators teaching it to a class. Drop a live demo into a lecture or assign it as a shareable link — no lab installs. Simulate a tax cut live below — adjust the inputs and watch it respond, right in your browser.
Controls
Dijkstra's algorithm finds the shortest path from a source (A, blue) to every other node in a weighted graph, always expanding the closest unvisited node next. The number inside each node is its shortest distance from A; the green edges trace the optimal route to your chosen destination. It powers GPS routing, network protocols, and logistics. Click any node to re-target.
Size a graph for the exportable Python solver below — the diagram stays a fixed six-node example.
Presets
Data Inspector
Governing equation
Runs locally in your browser — free forever. Scale to the cloud when reality gets heavy.
Controls
Presets
Linear programming maximizes a linear objective subject to linear constraints. The constraints carve out a convex feasible region (shaded), and the optimum always sits at a corner. Slide the objective coefficients and watch the optimal vertex jump between corners — the geometric idea behind the simplex algorithm that runs global logistics and finance.
Data Inspector
Governing equation
Runs locally in your browser — free forever. Scale to the cloud when reality gets heavy.
More with Facility Location
Frequently asked questions
- Is this good for educators?
- Yes — this version of "Facility Location for a tax cut" is framed for educators teaching it to a class. Drop a live demo into a lecture or assign it as a shareable link — no lab installs.
- Do I need to install anything?
- No. It runs in any modern browser, free, with no account required.