PPolySim OS
Launch Studio
Use case · powered by Facility Location

Facility Location for a monopoly

Simulate a monopoly live in your browser. This runs the real Facility Location solver — adjust the inputs, watch it respond instantly, and export the result. No install, no account.

For:StudentsResearchersEducatorsEngineersHobbyists & MakersK-12 StudentsFirst Responders
1

Shortest Path

open full solver →
Shortest Path (Dijkstra)Live

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

▶ Run in Python

Data Inspector

SourceA
DestinationF
Shortest distance11
Graph size6 nodes
Est. edges9 (60%)

Governing equation

Reading this result: Dijkstra grows a set of finalized nodes, each step expanding the nearest unvisited one and relaxing its outgoing edges. Because all weights are non-negative, the first time a node is finalized its distance is already optimal. This configuration describes 6 nodes and about 9 weighted edges (density 60%).

Runs locally in your browser — free forever. Scale to the cloud when reality gets heavy.

↓
2

Linear Programming

open full solver →
Linear ProgrammingLive

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.

▶ Run in Python

Data Inspector

Optimal x6.00
Optimal y4.00
Objective value26.00

Governing equation

Reading this result: Maximizing 3·x + 2·y lands the optimum at the corner (6.0, 4.0) worth 26.0 — a linear objective over a convex region always peaks at a vertex, so sliding c₁/c₂ just makes the solution hop between corners.

Runs locally in your browser — free forever. Scale to the cloud when reality gets heavy.

or unlock everything with Pro →

About this simulation

The full Facility Location tool models a monopoly with the same numerics engineers and scientists use — running entirely client-side. Change any parameter and the result updates in real time, so you can build intuition, check a design, or teach the concept without spreadsheets or installs.

More you can do with Facility Location

Facility Location for a supply-demand marketFacility Location for an auctionFacility Location for a tax policyFacility Location for a trade tariffFacility Location for an inflation modelFacility Location for a labor marketFacility Location for a game-theory standoffFacility Location for a price war

Other ways to simulate a monopoly

Supply & Demand for a monopolyPrice Elasticity for a monopolyMonopoly Pricing for a monopolyCobb-Douglas for a monopolyLorenz & Gini for a monopolyLaffer Curve for a monopoly

Frequently asked questions

How do I simulate a monopoly?
Open this page and use the live Facility Location tool below — set your inputs and the simulation runs instantly in your browser using real numerics. No install, no account needed.
Is it free?
Yes. The simulation runs free in your browser. A one-time unlock or a Pro plan adds advanced parameters, saved presets, data import, and clean exports.
Can I use my own numbers?
Absolutely — every input is adjustable, and with data import you can drive a monopoly from your own measurements.