Skip to main content
SpringerLink
Log in

A method of solution of a convex programming problem

  • 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. S.I. Zukhovitskii and L.I. Avdeeva, Linear and Convex Programming [in Russian], Nauka, Moscow (1967).

    Google Scholar 

  2. Anthony V. Fiacco and Garth P. McCormick, “Extensions of SUMT for nonlinear programming equality constraints and extrapolation,” Manag. Sci.,12, No. 11 (1966).

Download references

Authors
  1. V. N. Gordeev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 70–73, May–June, 1971.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gordeev, V.N. A method of solution of a convex programming problem. Cybern Syst Anal 7, 472–476 (1971). https://doi.org/10.1007/BF01070456

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation