Linear Bottleneck Assignment Problem     > Didactic Software     > Freeware           In the Linear Bottleneck Assignment Problem (LBAP) we are given an n x n cost matrix C = (cij), and we want to select n elements of C, so that there is exactly one element in each row and one in each column, and the maximum of the corresponding costs is a minimum.           Mathematical model:     By introducing a binary matrix X = (xij) such that:       1  if row i is assigned to column j, xij =     0  otherwise     LBAP can be modeled as:      min  max   cijxij   s.t.        n  ∑    j = 1  xij = 1      (i = 1,2,...n),                 n  ∑    i = 1  xij = 1      (j = 1,2,...n),                  xij {0,1}     (i, j = 1,2,...n)              To get more, read the Introduction