New lower bounds for the triplanar assignment problem. Use of the classical model

New sharp lower bounds are suggested for a triplanar assignment problem. They are based on the use of results of the theory of optimal control, the classical formulation of the problem, and represent, in our opinion, the “limit” use of the Hungarian algorithm ideas implemented for the two-index assignment problem.