Skip to main content
SpringerLink
Log in

Methods of solving simultaneously primal and dual convex-programming problems

  • 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. G. Dantzig, L. R. Ford, and D. R. Fulkerson, “An algorithm for the simultaneous solution of the primal and dual linear programming problem,” in: Symposium on Linear Inequalities and Associated Problems [Russian translation]. IL, Moscow (1959).

    Google Scholar 

  2. R. A. Polyak, “An algorithm for simultaneous solution of primal and dual convex-programming problem,” in: Symposium on Economic Cybernetics and Operations Research [in Russian], No. 3, Kiev (1966).

  3. O. Mangasarian, “Duality in nonlinear programming,” Quart. Appl. Math.,20, No. 3 (1962).

    Google Scholar 

  4. G. Zoutendijk, Methods of Feasible Directions, American Elsevier (1960).

  5. S. I. Zukhovitskii, R. A. Polyak, and M. E. Primak, “An algorithm for solving convex-programming problems,” Dokl. Akad. Nauk SSSR,53, No. 5, Moscow (1963).

Download references

Authors
  1. L. A. Kirievskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 134–138, May–June, 1974.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kirievskii, L.A. Methods of solving simultaneously primal and dual convex-programming problems. Cybern Syst Anal 10, 533–537 (1974). https://doi.org/10.1007/BF01068725

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation