Decomposition method for a class of transport-type problems with a quadratic objective function

A class of transport problems with a quadratic criterion without any restrictions on the sign of unknown variables is considered. An iterative algorithm based on the consecutive modification of the coefficients of the objective function is used. The problem is reduced to successively solving pairs o...

Full description

Saved in:
Bibliographic Details
Published in:Journal of computer & systems sciences international 2017-09, Vol.56 (5), p.796-802
Main Authors: Leonov, V. Yu, Tizik, A. P., Torchinskaya, E. V., Tsurkov, V. I.
Format: Article
Language:English
Subjects:
Algorithms
Computer science
Constrictions
Control
Engineering
Iterative algorithms
Lagrange multiplier
Mathematical analysis
Mechatronics
Quadratic programming
Robotics
Systems Analysis and Operations Research
Transport
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A class of transport problems with a quadratic criterion without any restrictions on the sign of unknown variables is considered. An iterative algorithm based on the consecutive modification of the coefficients of the objective function is used. The problem is reduced to successively solving pairs of problems from various groups of restrictions. These problems have one connecting variable and are solved analytically by the method of Lagrange multipliers. If the negative components appear in the course of solving them, the problem with one or several restrictions from one group and all restrictions from the other group is considered. These problems can also be easily solved for large dimensions, and in this way the dimension is reduced.
ISSN:1064-2307
1555-6530
DOI:10.1134/S1064230717050069