Abstract
This article examines the Dantzig-Wolfe decomposition method for solving large-scale optimization problems. The standard simplex algorithm solves these problems, making the Dantzig-Wolfe method a valuable tool. The article describes in detail a new modification of the Dantzig-Wolfe decomposition method. This modification aims to improve the efficiency of the coordination task, a key component that defines subtasks. By significantly reducing the number of rows in the coordination problem, the proposed method achieves faster computation and reduced memory requirements compared to the original approach. Although the Dantzig-Wolfe method has encountered problems due to the complexity of implementing algorithms for hierarchical systems, this modification opens up new potential.