Skip to main content
SpringerLink
Log in

Approximate solution of mathematical programming problems with constraint matrices of special structure

  • 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. T. T. Lebedeva, V. A. Roshchin, and I. V. Sergienko, “A procedure for solving mathematical-programming problems with mixed variables,” Kibernetika, No. 2 (1977).

  2. J. F. Benders, “Partitioning procedures for solving mixed-variable programming problems,” Numer. Math.,4, No. 3, (1962).

  3. L. S. Lasdon, Optimization Theory of Large Systems, Macmillan, New York (1970).

    Google Scholar 

Download references

Authors
  1. V. A. Roshchin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. V. Sergienko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 6, pp. 63–66, November–December, 1978.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Roshchin, V.A., Sergienko, I.V. Approximate solution of mathematical programming problems with constraint matrices of special structure. Cybern Syst Anal 14, 870–874 (1978). https://doi.org/10.1007/BF01070281

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation