Skip to main content
SpringerLink
Log in

Decomposition Method for Solving the Three-Index Problem of Effective Shooting

  • SYSTEM ANALYSIS AND OPERATIONS RESEARCH
  • Published:
Journal of Computer and Systems Sciences International Aims and scope

Abstract

The method of successive modification of the coefficients of the objective function is extended to three-index problems of effective shooting. At each step of the iterative process, problems with three constraints and one binding variable are solved. Degeneration due to nonuniqueness of the solution of the mentioned intermediate problems is considered. A procedure for degeneration removal is given. The final algorithm builds an exact solution to the original Boolean programming problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. E. G. Goldstein and D. B. Yudin, Problems of Linear Programming of Transport Type (Nauka, Moscow, 1969) [in Russian].

    Google Scholar 

  2. E. B. Trius, Problems of Mathematical Programming of Transport Type (Sov. Radio, Moscow, 1967) [in Russian].

    Google Scholar 

  3. V. S. Mikhalevich, I. V. Sergienko, and N. Z. Shor, “Study of methods for solving optimization problems and their applications,” Kibernetika, No. 4, 89–113 (1981).

  4. L. G. Raskin and I. O. Kirichenko, Multi-Index Linear Programming Problems (Radio Svyaz’, Moscow, 1982) [in Russian].

    MATH  Google Scholar 

  5. A. P. Tizik and V. I. Tsurkov, “Iterative functional modification method for solving a transportation problem,” Autom. Remote Control 73, 134 (2012).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Funding

This work was supported in part by the Russian Foundation for Basic Research, grant no. 21-51-53019 and the National Natural Science Foundation of China (grant no. 11971231; 12111530001).

Author information

Authors and Affiliations

  1. Federal Research Center “Computer Science and Control”, Russian Academy of Sciences, 119333, Moscow, Russia

    N. V. Antipova & V. I. Tsurkov

  2. Nanjing University of Aeronautics and Astronautics, 210016, Nanjing, China

    L. Wang

  3. Key Laboratory of Mathematical Modelling and High Performance Computing of Air Veicles, 211106, Nanjing, China

    L. Wang

  4. Central Research Institute of Communications, 111141, Moscow, Russia

    A. P. Tizik

Authors
  1. N. V. Antipova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. P. Tizik
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. V. I. Tsurkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. I. Tsurkov.

Ethics declarations

The authors declare that they have no conflicts of interest.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Antipova, N.V., Wang, L., Tizik, A.P. et al. Decomposition Method for Solving the Three-Index Problem of Effective Shooting. J. Comput. Syst. Sci. Int. 61, 962–969 (2022). https://doi.org/10.1134/S1064230722060028

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1064230722060028

Search

Navigation