For Students · Linear Programming
Linear Programming for a bin-packing plan
Built for students learning it for a class or exam. See the concept move instead of memorizing formulas — and check your homework intuition. Simulate a bin-packing plan live below — adjust the inputs and watch it respond, right in your browser.
Linear ProgrammingLive
optimize over a feasible region
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
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.
Also for:ResearchersEducatorsEngineersHobbyists & MakersK-12 StudentsFirst RespondersGeneral version →
More with Linear Programming
Linear Programming for a delivery routeLinear Programming for a warehouse layoutLinear Programming for a factory scheduleLinear Programming for a staff rosterLinear Programming for a portfolio mixLinear Programming for a supply chainLinear Programming for a knapsackLinear Programming for a network flow
Frequently asked questions
- Is this good for students?
- Yes — this version of "Linear Programming for a bin-packing plan" is framed for students learning it for a class or exam. See the concept move instead of memorizing formulas — and check your homework intuition.
- Do I need to install anything?
- No. It runs in any modern browser, free, with no account required.