Skip to main content
SpringerLink
Log in

Symmetric duality for lexicographic linear programming problems

  • Published:
Ukrainian Mathematical Journal Aims and scope

Abstract

A symmetric pair of lexicographic linear-programming (LP) problems, connected by regular relations, is formulated for problems of multicriteria linear optimization. A duality theorem for improper linear-programming problems (ILPP) is constructed in terms of lexicographic optimization.

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

Similar content being viewed by others

Literature cited

  1. I. I. Eremin and N. N. Astaf'ev, Introduction to the Theory of Linear and Convex Programming [in Russian], Nauka, Moscow (1976).

    Google Scholar 

  2. S. N. Chernikov, Linear Inequalities [in Russian], Nauka, Moscow (1968).

    Google Scholar 

  3. I. I. Eremin, “Duality for improper problems of linear and convex programming,” Dokl. Akad. Nauk SSSR,256, No. 2, 272–276 (1981).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Mechanics, Academy of Sciences of Russia, Ural Branch, Ekaterinburg

    I. I. Eremin

Authors
  1. I. I. Eremin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Ukrainskii Maternaticheskii Zhurnal, Vol. 44, No. 6, pp. 766–773, June, 1992.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Eremin, I.I. Symmetric duality for lexicographic linear programming problems. Ukr Math J 44, 690–696 (1992). https://doi.org/10.1007/BF01056948

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation