Skip to main content
SpringerLink
Log in

Using block-diagonal systems of constraints in algorithms reducing the dimensionality of linear programs

  • Published:
Cybernetics Aims and scope

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

Literature Cited

  1. I. A. Danil'chenko, Yu. M. Makarenkov, and E. F. Pshennova, “A method of preliminary size reduction of linear programming problems with a nonnegative constraint matrix,” Kibernetika, No. 3, 103–106 (1980).

    Google Scholar 

Download references

Authors
  1. I. A. Danil'chenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yu. M. Makarenkov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. E. F. Pshennova
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 6, pp. 54–57, November–December, 1981.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Danil'chenko, I.A., Makarenkov, Y.M. & Pshennova, E.F. Using block-diagonal systems of constraints in algorithms reducing the dimensionality of linear programs. Cybern Syst Anal 17, 779–783 (1981). https://doi.org/10.1007/BF01069227

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation