Modification of the Danzig-Wolf Decomposition Method for Building Hierarchical Intelligent Systems
Velyamov T. Kim A. Manankova O.
2024Science and Information Organization
International Journal of Advanced Computer Science and Applications
2024#15Issue 71160 - 1167 pp.
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.
Decomposition method , linear programming , optimization , parallel processing
Text of the article Перейти на текст статьи
Department of Technical Disciplines, Kazakhstan University of Innovation and Telecommunication Systems, Almaty, Kazakhstan
Department of Mechanics, Al-Farabi Kazakh National University, Almaty, Kazakhstan
Department of Computer Engineering, International Information Technology University, Almaty, Kazakhstan
Department of Technical Disciplines
Department of Mechanics
Department of Computer Engineering
10 лет помогаем публиковать статьи Международный издатель
Книга Публикация научной статьи Волощук 2026 Book Publication of a scientific article 2026