Skip to main content
SpringerLink
Log in

Random search method for solving series of linear programming problems

  • Published:
Journal of Soviet Mathematics Aims and scope Submit manuscript

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. K. A. Mironovskii and R. N. Latifullin, “Dimension reduction of optimization problems by Gauss' method,” Kibernetika, No. 2, 113–115 (1984).

    Google Scholar 

  2. K. A. Mironovskii and V. R. Fazylov, “Method of successive projection withε-descent,” Izv. Vyssh. Uchebn. Zaved., Mat., No. 10, 47–48 (1981).

    Google Scholar 

  3. V. R. Fazylov, “A general method to find a point of a convex set,” Izv. Vyssh. Uchebn. Zaved., Mat., No. 6, 43–51 (1983).

    Google Scholar 

  4. A. N. Kulikov and V. R. Fazylov, “A finite method for solving systems of convex inequalities,” Izv. Vyssh. Uchebn. Zaved., Mat., No. 11, 59–63 (1984).

    Google Scholar 

Download references

Authors
  1. A. I. Vafina
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. R. Fazylov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Issledovaniya po Prikladnoi Matematike, No. 16, pp. 120–124, 1989.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vafina, A.I., Fazylov, V.R. Random search method for solving series of linear programming problems. J Math Sci 61, 2470–2472 (1992). https://doi.org/10.1007/BF01100584

Download citation

  • Issue Date:

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

Keywords

Search

Navigation