Skip to main content
Log in

Linear multiobjective maxmin optimization and some Pareto and lexmaxmin extensions

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

Summary

This is a lexmaxmin extension of some results on linear maxmin programming recently obtained by Posner and Wu, Kaplan, Gupta and Arora, and Kabe. The findings of these authors will be combined with previous results by the author of the present paper to give further insight into the interrelation between optimization with respect to maxmin, Pareto, and lexmaxmin.

Zusammenfassung

Diese Arbeit enthält Lexmaxmin-Erweiterungen einiger jüngerer Ergebnisse von Posner und Wu, von Kaplan, von Gupta und Arora und von Kabe über lineare Maxmin-Probleme. Die Beobachtungen der genannten Autoren werden mit früheren Ergebnissen des Autors der vorliegenden Arbeit mit dem Ziel vereint, weitere Einsichten in den Zusammenhang zwischen Maxmin-, Pareto- und Lexmaxmin-Optimierung zu vermitteln.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Achilles A, Elster K-H, Nehse R (1979) Bibliographie zur Vektoroptimierung. Theorie und Anwendungen. Optimization, Math Operationsf Statist 10:277–321

    Google Scholar 

  2. Behringer FA (1970) Optimale Skalierung gewisser auf dem Analogrechner zu lösender Differentialgleichungssysteme durch lineare Optimierung. Ann Assoc Int Cal Analogiques 12:64–74

    Google Scholar 

  3. Behringer FA (1977) Lexicographic quasiconcave multiobjective programming. Z O R 21:103–116

    Google Scholar 

  4. Behringer FA (1981) A simplex based algorithm for the lexicographically extended linear maxmin problem. Eur J Oper Res 7:274–283

    Article  Google Scholar 

  5. Choo EU, Atkins DR (1983) Proper efficiency in nonconvex multicriteria programming. Math Oper Res 8:467–470

    Article  Google Scholar 

  6. Descloux J (1963) Approximations inL p and Chebyshev approximations. J Soc Ind Appl Math 11:1017–1026

    Article  Google Scholar 

  7. Ester J, Schwarz B (1983) Ein erweitertes Effizienztheorem. Math Operationsf Statist, Ser Optimization 14: 331–342

    Article  Google Scholar 

  8. Gupta R, Arora SR (1977) Programming problem with maxmin objective function. Opsearch 14:125–130

    Google Scholar 

  9. Gupta R, Arora SR (1978) Programming problem with maxmin objective function. Z O R 22:69–72

    Google Scholar 

  10. Iserman H (1982) Linear lexicographic optimization. OR Spektrum 4:223–228

    Article  Google Scholar 

  11. Jahn J (1985) Some characterizations of the optimal solutions of a vector optimization problem. OR Spektrum 7: 7–17

    Article  Google Scholar 

  12. Kabe DG (1982) On maxmin objective function programming. Utilitas Mathematica 21C:49–54

    Google Scholar 

  13. Kaplan S (1974) Application of programs with maxmin objective functions to problems of optimal resource allocation. Oper Res 22:802–807

    Article  Google Scholar 

  14. Kornbluth JSH, Steuer R (1981) Multiple objective linear fractional programming. Manag Sci 27:1024–1039

    Article  Google Scholar 

  15. Nehse R (1982) Bibliographie zur Vektoroptimierung-Theorie und Anwendungen (1. Fortsetzung). Optimization, Math Operationsf Statist 13:593–625

    Article  Google Scholar 

  16. Posner ME, Wu C (1981) Linear max-min programming. Math Programm 20:166–172

    Article  Google Scholar 

  17. Rockafellar RT (1970) Convex analysis. Princeton University Press, Princeton

    Book  Google Scholar 

  18. Schmeidler D (1969) The nucleolus of a characteristic function game. SIAM J Appl Math 17:1163–1170

    Article  Google Scholar 

  19. Sen AK (1970) Collective Choice and Social Welfare. Holden-Day, San Francisco

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Behringer, F.A. Linear multiobjective maxmin optimization and some Pareto and lexmaxmin extensions. OR Spektrum 8, 25–32 (1986). https://doi.org/10.1007/BF01720769

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Navigation