Facility Location
Demand & cost. This multi-solver chains 2 solvers into a single guided workflow — run each step in order and carry the result forward.
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.
We build custom solvers and workflows for labs, firms, agencies, and courses — your parameters, your branding, your data.
Explore Custom Solver Sets →More in the Operations & Economics pack
Frequently asked questions
- What is the Facility Location multi-solver?
- Facility Location is a guided workflow that chains 2 individual PolySim solvers into one end-to-end analysis, piping each result into the next step.
- Is it free to use?
- Yes. Every step runs entirely in your browser using real numerics — no install, no account, no cloud cost. Custom or private solver packs are available as a paid service.