Skip to main content
Log in

Sequential analysis in large-scale problems in linear programming

  • Published:
Cybernetics Aims and scope

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

Access this article

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

Instant access to the full article PDF.

Literature Cited

  1. N. N. Moiseev (ed.), Contemporary State of the Theory of Operations Research [in Russian], Nauka, Moscow (1979).

    Google Scholar 

  2. I. A. Danil'chenko, Yu. M. Makarenkov, and E. F. Pshennova, “Preliminary reduction of the dimensionality of problems in linear programming with a nonnegative condition matrix,” Kibernetika, No. 3, 103 (1980).

    Google Scholar 

  3. V. S. Mikhalevich, “Sequential optimization algorithms and their application,” Kibernetika, No. 1, 45 (1965); No. 2, 85 (1965).

    Google Scholar 

  4. V. L. Volkovich and A. F. Voloshin, “One scheme of the sequential analysis method and sifting of alternatives,” Kibernetika, No. 4, 98 (1978).

    Google Scholar 

  5. T. C. Hu, Integer programming and Network Flows [Russian translation], Mir, Moscow (1974).

    Google Scholar 

Download references

Authors

Additional information

Translated from Kibernetika, No. 4, pp. 114–120, July–August, 1981.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mikhalevich, V.S., Volkovich, V.L. & Voloshin, A.F. Sequential analysis in large-scale problems in linear programming. Cybern Syst Anal 17, 548–556 (1981). https://doi.org/10.1007/BF01082483

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01082483

Keywords

Navigation