Skip to main content
SpringerLink
Log in

A method of lexicogeaphic search for solutions of discrete convex programming problems

  • Brief Communications
  • Published:
Ukrainian Mathematical Journal 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. A. Korbut, Yu. Yu. Finkelshtein, Discrete Programming, Nauka, Moscow (1969).

    Google Scholar 

  2. G. L. Thompson, “The stopped simplex method: I. Basic theory for mixed integer programming; integer programming, ” Rev. franc., rech, operat,8, No. 31 (1964).

Download references

Author information

Authors and Affiliations

  1. Uzhgorod State University, USSR

    Yu. Yu. Chervak

Authors
  1. Yu. Yu. Chervak
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 26, No. 2, pp. 269–272, March–April, 1974.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chervak, Y.Y. A method of lexicogeaphic search for solutions of discrete convex programming problems. Ukr Math J 26, 226–229 (1974). https://doi.org/10.1007/BF01085727

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation