Developing Systems

The effect of decomposition on the convergence rate of a Decomposition method in linear programming

G. E. Moiseenko

Moscow

Abstract: Experimental findings are reported on the dependence of the rate of convergence of a decomposition method for linear programming problems (such as the Karnay-Liptak method), the total number of iterations, and the solution time on the number of subproblems into which the original problem is decomposed.

UDC: 62-505


Received: 27.05.1982

 English version: Automation and Remote Control, 1984, 45:3, 380–383

Bibliographic databases:

• 
•