Developing Systems

A direct method for decomposition of a linear programming problem. I

V. E. Krivtsov

Moscow

Abstract: A direct decomposition method is suggested for a linear programming problem whereby the original problem is reduced to a piecewise-linear programming problem. The latter is solved by using a special algorithm which implements a procedure of methods of feasible directions. An example is discussed.

UDC: 519.82:518.5


Received: 07.08.1980

 English version: Automation and Remote Control, 1981, 42:11, 1516–1523

Bibliographic databases:

• 
•