Skip to main content
SpringerLink
Log in

A method of solution of a nonlinear programming problem with constraints of the type of equalities or inequalities

  • 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. H. W. Kuhn and A. W. Tucker, “Nonlinear programming,” in: Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability (edited by J. Neyman), University of California Press, Berkeley (1951).

    Google Scholar 

  2. E. A. Nurminskii, “Convergence conditions of linear programming algorithms,” Kibernetika, No. 6 (1972).

Download references

Authors
  1. E. A. Nurminskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika No. 1, pp. 96–98, January–February, 1974.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nurminskii, E.A. A method of solution of a nonlinear programming problem with constraints of the type of equalities or inequalities. Cybern Syst Anal 10, 118–122 (1974). https://doi.org/10.1007/BF01069027

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation