Decompositional Method for the Optimization Problem of Effective Shooting

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-uniq...

Full description

Saved in:
Bibliographic Details
Published in:Journal of computer & systems sciences international 2021-11, Vol.60 (6), p.913-917
Main Authors: Wang, L. P., Esenkov, A. S., Strelkova, E. S., Tizik, A. P.
Format: Article
Language:English
Subjects:
Algorithms
Boolean algebra
Computer Methods
Control
Degeneration
Engineering
Exact solutions
Iterative methods
Mechatronics
Optimization
Robotics
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1064-2307
1555-6530
DOI:10.1134/S1064230721060162