Skip to main content

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 345))

Abstract

The bicriteria maximization problem has been studied mainly by several authors mainly with the aim of establishing the connectedness of the set E of all efficient points. In this paper we will introduce a parametric real-valued function which allows us either to derive a parametric representation of E in a general form or to find sequential methods for generating E.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Avriel M., Non linear programming: Analysis and Methods. Prentice Hall, Englewood Cliffs, N.Y., 1976.

    Google Scholar 

  2. Avriel M., Diewert W.E.. Schaible S., Zang I., Generalized concavity. Plenum Press. New York and London, 1988

    Google Scholar 

  3. Benson H.P., Vector maximization with two objective functions. Journal of Optimization Theory and Applications, vol.28, pp.253–257, 1979.

    Google Scholar 

  4. Choo E.U., Atkins D.R., Bicriteria linear fractional programming. Journal of Optimization Theory and Applications, vol. 36, pp.203–220, 1982.

    Google Scholar 

  5. Choo E.U., Atkins D.R., Connectedness in multiple linear fractional programming. Management Sciences, vol.29, pp.250–255, 1983.

    Google Scholar 

  6. Choo E.U.. Schaible S., Chew K.P., Connectedness of the efficient set in three criteria quasiconcave programming. Cahiers du C.E.R.O., vol.27, pp.213–220, 1985.

    Google Scholar 

  7. Martein L., On generating the set of all efficient points of a bicriteria linear fractional problem. This volume.

    Google Scholar 

  8. Schaible S., Bicriteria Quasiconcave Programs. Cahiers du C.E.R.O., vol. 25, pp.93–101, 1983.

    Google Scholar 

  9. Cambini A., Martein L., Pellegrini L., A decomposition algorith for a particular class of nonlinear programs. Actes du Io Colloque AFCET-SMF.Tome III, pp. 179–189, Palaiseau (France), 1978.

    Google Scholar 

  10. Cambini A., Martein L., Sodini C, An algorithm for two particular nonlinear fractional programs. Methods of Operations Research, vol. 45, pp.61–70, Athenaum/Hain/Honstein, 1983.

    Google Scholar 

  11. Cambini A., Martein L., Schaible S., On maximizing a sum of ratios. Journal of Information and Optimization Sciences, vol.10, nl, 1989.

    Google Scholar 

  12. Martein L., Schaible S., On solving a linear program with a quadratic constraint. Rivista Matematica per le Scienze Economiche e Sociali, anno 10, n.2.

    Google Scholar 

  13. Bank B., Guddat J., Klatte D., Kummer B., Tammer IL, Non-linear parametric Optimization. Akademie-Verlag-Berlin, 1982.

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Martein, L. (1990). On the Bicriteria Maximization Problem. In: Cambini, A., Castagnoli, E., Martein, L., Mazzoleni, P., Schaible, S. (eds) Generalized Convexity and Fractional Programming with Economic Applications. Lecture Notes in Economics and Mathematical Systems, vol 345. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46709-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-46709-7_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52673-5

  • Online ISBN: 978-3-642-46709-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics