Decomposition Method for Solving Three-Index Transportation Problems


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

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.

作者简介

L. Wang

Nanjing University of Aeronautics and Astronautics

Email: tizik_ap@mail.ru
中国, Nanjing, 210016

A. Esenkov

Computer Science and Control Federal Research Center

Email: tizik_ap@mail.ru
俄罗斯联邦, Moscow, 119333

A. Tizik

Computer Science and Control Federal Research Center

编辑信件的主要联系方式.
Email: tizik_ap@mail.ru
俄罗斯联邦, Moscow, 119333

E. Torchinskaya

Moscow Institute of Physics and Technology (State University)

Email: tizik_ap@mail.ru
俄罗斯联邦, Dolgoprudny, Moscow oblast, 141701


版权所有 © Pleiades Publishing, Ltd., 2018
##common.cookie##