Closed transportation models with minimax criterion

Transportation problems are investigated by replacing the classical transportation cost minimization functionals by minimax functionals. Transportation models with minimax criteria are described and optimization algorithms for them are designed. A formula for computing the minimax matrix (a matrix of the classical transportation polyhedron whose largest element is minimal) of the transportation polyhedron is derived. One of the algorithms generates a (hereditarily minimax) matrix such that every each of its submatrices is a minimax matrix of the transportation polyhedron to which the matrix belongs.