Assignment Problem Calculators
Solve assignment problems of different types—balanced, unbalanced, minimization, maximization, and restricted— using interactive tools that apply the Hungarian method and related techniques step by step.
All calculators on this page are live and free to use. You can also explore more tools in our Operations Research (Optimization) section or return to the homepage.
Assignment Problem Solver – Hungarian Method
Solve standard balanced minimization assignment problems. Shows each Hungarian method step and the final optimal assignment with total cost.
Assignment Problem – Maximization
Convert and solve maximization assignment problems using the Hungarian method. Automatically handles profit/benefit matrices and returns the maximum total value.
Unbalanced Assignment Problem Calculator
Handle cases where the number of jobs and agents are not equal. The tool adds dummy rows or columns as needed and then applies the Hungarian method.
Restricted Assignment Problem Calculator
Solve assignment problems with prohibited assignments or restrictions. Mark forbidden cells and get a feasible optimal assignment if one exists.
Which Assignment Problem Calculators Are Available?
This section focuses on the classical assignment problem and its common variants that appear in operations research, engineering, and management science courses. You can currently use:
- Hungarian Method (Balanced Minimization) For standard assignment problems where the number of agents equals the number of tasks and the objective is to minimize overall cost, time, or distance. The calculator shows each Hungarian method step so you can follow or check your manual solution.
- Maximization Assignment Problem For profit or effectiveness matrices where you want to maximize the total value. The tool internally converts the maximization model into an equivalent minimization form and then applies the Hungarian method.
- Unbalanced Assignment Problem For situations where the number of agents and tasks are not equal. The calculator automatically introduces dummy rows or columns to balance the problem and then solves it optimally.
- Restricted Assignment Problem For models where some assignments are forbidden (for example, an agent cannot perform a certain job). You can mark such cells as restricted, and the solver will search for an optimal feasible solution if it exists.
These tools are designed for students, teachers, and practitioners who want quick, reliable solutions without getting lost in manual tables, while still seeing the underlying method.