JournalVolume 4, №1An efficient decomposition method for linear programming problems (pages 54-60) Rafael H. Hamidov, Anar R. Hamidov Abstract. In this paper a new decomposition method for linear programming is suggested. Here the dual variables corresponding to the relating constraints of all the primal problems variables play the part of parameters. We decompose the parameters space into a Finite number of polyhedrals so that for each polyhedron there is an associated optimal extreme point and we are searching for such one of the polyhedrons where the optimal value of corresponding the linear programming problem is the optimal value of the primal problem. We study the computational method and illustrate it by an example.
|
|