Assignment problem solver: match workers to jobs at the lowest cost
Each worker does exactly one job and each job gets exactly one worker; find the matching with the lowest total cost or time. Edit the numbers below and solve, no account needed. The assignment is proven optimal by an integer programming solver.
Solve it here
The example below is the Assignment problem worked example; its saved answer, checked by the solver, is 9 (optimal).
How to type it
- First line:
maximizeorminimizeand the objective, such as3*a + 2*b. - Then
subject toand one constraint per line with<=,>=or=. a, b >= 0for nonnegative variables;integer: aorbinary: zfor whole-number or yes/no ones.- Lines starting with
#are notes, such as what a variable means.
What you get here
- who does which job (1 = assigned), and the total cost or time
- a check that every worker and every job is used exactly once
- the proof label from the integer programming solver
With a free account: the full step-by-step walkthrough, word problems, photos and voice, and your history.
Worked examples
Questions
Is this the Hungarian method?
It gives the same optimal assignment, found by an integer programming solver instead of the Hungarian steps, and checked.
Can I maximize instead, such as total skill?
Yes: write maximize on the first line.
More: all calculators · 50 solved examples · what the app solves
Try ProvenDecisions free: type, photograph or say an optimization problem; every answer is checked by a solver.