Decomposition Method for Solving Three-Index Transportation Problems

Аннотация

A decomposition method based on the sequential modification of the optimality criterion is used for solving the classical three-index transportation problem. The method consists of a sequence of solutions of local problems with three constraints. A monotonic (in the optimality criterion) process that converges to the solution of the original problem is constructed. The solutions of the transportation problem with a linear and quadratic objective function are considered and the numerical results are presented.