Skip to main content
SpringerLink
Log in

The simplex method in coordinate-free formulation

  • 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. A. M. Vershik, “Some remarks on infinite-dimensional linear programming problems,” Usp. Mat. Nauk,25, No. 5, 117–124 (1970).

    Google Scholar 

  2. N. Bourbaki, Eléments de Mathématique, Espaces Vectoriels Topologiques, Hermann, Paris (1953–1955).

    Google Scholar 

  3. A. D. Ioffe and V. I. Tikhomirov, The Theory of Extremal Problems [in Russian], Nauka, Moscow (1974).

    Google Scholar 

  4. N. Bourbaki, Eléments de Mathématique, Algèbre, Hermann, Paris (1950–1951).

    Google Scholar 

  5. P.-J. Laurent, Approximation et Optimization, Hermann, Paris (1972).

    Google Scholar 

Download references

Authors
  1. L. E. Faibusovich
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 2, pp. 78–81, March–April, 1983.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Faibusovich, L.E. The simplex method in coordinate-free formulation. Cybern Syst Anal 19, 247–252 (1983). https://doi.org/10.1007/BF01072027

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation