Abstract
The method of sequential modification of the coefficients of the target function for transport-type problems is extended to the class of efficient shooting problems. At each step of the iterative process, problems with two constraints and one binding variable are solved. Degeneration due to non-uniqueness of the solution of the mentioned intermediate problems is considered. A procedure for removing degeneracy is given. The final algorithm constructs an exact solution to the original Boolean programming problem. The exponential growth of the computation time is experimentally established depending on the dimension of the original problem.
Similar content being viewed by others
REFERENCES
E. G. Gol’shtein and D. B. Yudin, Transport-Type Linear Programming Problems (Nauka, Moscow, 1969) [in Russian].
A. P. Tizik and V. I. Tsurkov, “Iterative functional modification method for solving a transportation problem,” Autom. Remote Control 73, 134 (2012).
D. I. Kuzovlev, A. P. Tizik, and Yu. P. Treskov, “Method of sequential modification of the objective function in the assignment problem,” J. Comput. Syst. Sci. Int. 50, 921 (2011).
D. I. Kuzovlev, A. P. Tizik, and Yu. P. Treskov, “Decompositional algorithm for solving transportation problem with fixed channel capasities,” Mekhatron., Avtomatiz., Upravl., No. 1, 45–48 (2012).
A. P. Tizik, D. I. Kuzovlev, and A. A. Sokolov, “Method of successive modifications of functional for transportation problem with additional warehouse points for suppliers and consumers,” Vestn. TvGU, Ser. Prikl. Mat., No. 4 (27), 91–98 (2012).
Funding
This study was partially financially supported by the Russian Foundation for Basic Research (grant 21-51-53019) and the State Natural Science Foundation of China (grants 11971231 and 1211153001).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wang, L.P., Esenkov, A.S., Strelkova, E.S. et al. Decompositional Method for the Optimization Problem of Effective Shooting. J. Comput. Syst. Sci. Int. 60, 913–917 (2021). https://doi.org/10.1134/S1064230721060162
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1064230721060162