# Bottleneck assignment problem

This is the assignment problem, where the "cost", $LaTeX: c_{i, j}$, is the rate at which person $LaTeX: i$ can perform job $LaTeX: j$. The objective is to maximize the rate of production of the entire assembly line.