Skip to main content
SpringerLink
Log in

A Sequential Method for a Class of Bicriteria Problems

  • Conference paper
Book cover Generalized Convexity and Related Topics

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

  • 632 Accesses

Summary

The aim of the paper is to suggest a sequential method for generating the set E of all efficient points of a bicriteria problem P B where the feasible region is a polytope and whose criteria are a linear function and a concave function which is the sum of a linear and the reciprocal of an affine function. The connectedness of E and some theoretical properties of P B allow to give a finite simplex-like algorithm based on a suitable post-optimality analysis carried on a scalar parametric problem where the linear criteria plays the role of a parametric constraint.

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

Access this chapter

Log in via an institution
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. Cambini A (1981) An algorithm for a particular class of generalized convex programs. In: Schaible S, Ziemba WT (eds) Generalized concavity in optimization and economics, Academic Press, New York.

    Google Scholar 

  2. Cambini A, Crouzeix JP, Martein L (2002) On the pseudoconvexity of a quadratic fractional function. Optimization 51:677–687.

    Article  MATH  MathSciNet  Google Scholar 

  3. Cambini A, Martein L (1986) A modified version of Martos’s algorithm for the linear fractional problem. Methods of Operation Research 53:33–44.

    MATH  MathSciNet  Google Scholar 

  4. Cambini A, Martein L (1988) The linear fractional and the bicriteria linear fractional problem. In: Cambini A, Castagnoli E, Martein L, Mazzoleni P, Scaible S (eds) Generalized Convexity and Fractional Programming with Economic Applications, Springer Verlag, Berlin Heidelberg New York.

    Google Scholar 

  5. Cambini A, Martein L (1990) Reciprocity in optimization and efficiency in the bicriteria problem: a unified approach. In: Bühler W, Feichtinger G, Hartl RF, Radermacher FJ, Stähly P (eds) Operations Research Proceedings, Springer Verlag, Berlin Heidelberg New York.

    Google Scholar 

  6. Cambini A, Martein L (1992) Equivalence in linear fractional programming. Optimization 23:41–51.

    MATH  MathSciNet  Google Scholar 

  7. Cambini A, Martein L, Schaible S (1989) On maximizing a sum of ratios. Journal of Information and Optimization Sciences 10:65–79.

    MATH  MathSciNet  Google Scholar 

  8. Cambini A, Martein L, Stancu-Minasian (1996) Some developments in bicriteria fractional programming. In: Ding-Zhu DU, Xiang-Sun ZHANG, Kan CHENG (eds) Operations Research and its Applications, World Publishing Corporation.

    Google Scholar 

  9. Cambini A, Martein L, Stancu-Minasian (1999) A survey of bicriteria fractional programming. Electronic International Journal Advanced Modelling and Optimization 1:9–46.

    Google Scholar 

  10. Choo EU, Atkins DR (1982) Bicriteria linear fractional programming. Journal of Optimization Theory and Applications 36:203–226.

    Article  MATH  MathSciNet  Google Scholar 

  11. Ellero A (1996) The optimal level solutions method. Journal of Information and Optimization Sciences 17:355–372.

    MATH  MathSciNet  Google Scholar 

  12. Frenk JBG, Schaible S (2005) Fractional programming. In: Hadjisavvas N, Komlosi S, Schaible S (eds) Handbook of Generalized Convexity and Generalized Monotonicity, Springer.

    Google Scholar 

  13. Martein L (1988) 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, Springer Verlag, Berlin Heidelberg New York.

    Google Scholar 

  14. Schaible S (1983) Bicriteria quasiconcave programs. Cahiers du C.E.R.O. 25:93–101.

    MATH  MathSciNet  Google Scholar 

  15. Schaible S (1981) A survey of fractional programming. In: Schaible S, Ziemba WT (eds) Generalized concavity in optimization and economics, Academic Press New York.

    Google Scholar 

  16. Schaible S (1995) Fractional programming. In: Host R, Pardalos PM (eds) Handbook of Global Optimization, Kluwer Acadamic Publishers.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Statistics and Applied Mathematics, University of Pisa, Italy

    Laura Martein & Valerio Bertolucci

Authors
  1. Laura Martein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Valerio Bertolucci
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Martein, L., Bertolucci, V. (2007). A Sequential Method for a Class of Bicriteria Problems. In: Generalized Convexity and Related Topics. Lecture Notes in Economics and Mathematical Systems, vol 583. Springer, Berlin, Heidelberg . https://doi.org/10.1007/978-3-540-37007-9_21

Download citation

Publish with us

Policies and ethics

Search

Navigation