Skip to main content
SpringerLink
Log in

Linear lexicographic optimization

  • Theoretical Papers
  • Published:
Operations-Research-Spektrum Aims and scope Submit manuscript

Summary

The relevance of lexicographic optimization may be located in the field of multiple criteria decision making as well as in mathematical programming. In this paper we shall introduce the lexicographic simplex method and the underlying existence and duality theory. Some applications of lexicographic optimization will also be outlined.

Zusammenfassung

Dieser Beitrag beschäftigt sich mit dem linearen lexikographischen Optimierungsproblem. Es werden Anwendungen dargestellt sowie ein Lösungsverfahren und die ihm zugrunde liegende Existenz- und Dualitätstheorie vorgestellt.

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

References

  1. Behringer FA (1972) Lexicographic quasiconcave multi-objective programming. ZOR 21:103–116

    Google Scholar 

  2. Charnes A, Cooper WW (1961) Management models and industrial applications of linear programming, vol I. John Wiley, New York

    Google Scholar 

  3. Dantzig GB (1963) Linear programming and extensions. University Press, Princeton, NJ

    Book  Google Scholar 

  4. Frieze AM (1975) Bottleneck linear programming. ORQ 26:871–874

    Article  Google Scholar 

  5. Garfinkel RS, Rao MR (1971) The bottleneck transportation problem. NRLQ 18:465–472

    Article  Google Scholar 

  6. Hammer JP (1969) Time-minimizing transportation problems. NRLQ 16:345–357

    Article  Google Scholar 

  7. Ignizio JP (1976) Goal programming and extensions. Lexington Books, Heath, Lexington, MA

    Google Scholar 

  8. Isermann H (1974) Lineare Vektoroptimierung. Diss. Universität Regensburg

  9. Lasdon LS (1970) Optimization theory for large systems. Macmillian, New York

    Google Scholar 

  10. Lee SM (1972) Goal programming for decision analysis. Auerbach, Philadelphia

    Google Scholar 

  11. Simmonard M (1972), Programmation linéaire, 2nd ed. Dunod, Paris

    Google Scholar 

  12. Srinivasan V, Thompson GL (1976) Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems. NRLQ 23:567–595

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Wirtschaftswissenschaften, Universität Bielefeld, D-4800, Bielefeld, Germany

    H. Isermann

Authors
  1. H. Isermann
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Isermann, H. Linear lexicographic optimization. OR Spektrum 4, 223–228 (1982). https://doi.org/10.1007/BF01782758

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation