Skip to main content
Log in

Bicriteria linear fractional programming

  • Contributed Papers
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

As a step toward the investigation of the multicriteria linear fractional program, this paper provides a thorough analysis of the bicriteria case. It is shown that the set of efficient points is a finite union of linearly constrained sets and the efficient frontier is the image of a finite number of connected line segments of efficient points. A simple algorithm using only one-dimensional parametric linear programming techniques is developed to evaluate the efficient frontier.

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. Ecker, J. G., Hegner, N. S., andKouada, I. A.,Generating All Maximal Efficient Faces for Multiple Objective Linear Programs, Journal of Optimization Theory and Applications (to appear).

  2. Yu, P. L., andZeleny, M.,The Set of All Nondominated Solutions in the Linear Cases and a Multicriteria Simplex Method, Journal of Mathematical Analysis and Applications, Vol. 49, pp. 430–468, 1975.

    Google Scholar 

  3. Evans, J. P., andSteuer, R. E.,A Revised Simplex Method for Linear Multiple Objective Programs, Mathematical Programming, Vol. 5, pp. 54–72, 1973.

    Google Scholar 

  4. Isermann, H.,The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program, Operational Research Quarterly, Vol. 28, pp. 711–725, 1977.

    Google Scholar 

  5. Gal, T.,A General Method for Determining the Set of All Efficient Solutions to a Linear Vector Maximum Problem, European Journal of Operational Research, Vol. 1, pp. 307–322, 1977.

    Google Scholar 

  6. Yu, P. L.,Cone Convexity, Cone Extreme Points, and Nondominated Solutions in Decision Problems with Multiobjectives, Journal of Optimization Theory and Applications, Vol. 14, pp. 319–377, 1974.

    Google Scholar 

  7. Arrow, K. J., Barankin, E. W., andBlackwell, D.,Admissible Points of Convex Sets, Contributions to the Theory of Games, Vol. 2, Edited by H. W. Kuhn and A. W. Tucker, Princeton University Press, Princeton, New Jersey, 1953.

    Google Scholar 

  8. Bitran, G. R., andMagnanti, T. L.,The Structure of Admissible Points with Respect to Cone Dominance, Journal of Optimization Theory and Applications, Vol. 29, pp. 573–614, 1979.

    Google Scholar 

  9. Geoffrion, A. M.,Proper Efficiency and the Theory of Vector Maximization, Journal of Mathematical Analysis and Applications, Vol. 22, pp. 618–630, 1968.

    Google Scholar 

  10. Naccache, P. H.,Connectedness of the Set of Nondominated Outcomes in Multicriteria Optimization, Journal of Optimization Theory and Applications, Vol. 25, pp. 459–467, 1978.

    Google Scholar 

  11. Geoffrion, A. M.,Solving Bicriterion Mathematical Programs, Operations Research, Vol. 15, pp. 39–54, 1967.

    Google Scholar 

  12. Hocking, R. R., andSheppard, R. L.,Parametric Solution of a Class of Nonconvex Programs, Operations Research, Vol. 19, pp. 1742–1747, 1971.

    Google Scholar 

  13. Benson, H. P.,Vector Maximization with Two Objective Functions, Journal of Optimization Theory and Applications, Vol. 28, pp. 253–257, 1979.

    Google Scholar 

  14. Cohon, J. L., Church, R. L., andSheer, D. P.,Generating Multiobjective Trade-Offs: An Algorithm for Bicriterion Problems, Water Resources Research, Vol. 15, pp. 1001–1010, 1979.

    Google Scholar 

  15. Adulbhan, P., andTabucanon, M. T.,Bicriterion Linear Programming, Computer and Operations Research, Vol. 4, pp. 147–153, 1977.

    Google Scholar 

  16. Aneja, Y. P., andNair, K. P. K.,Bicriteria Transportation Problem, Management Science, Vol. 25, pp. 73–78, 1979.

    Google Scholar 

  17. Charnes, A., andCooper, W. W.,Programming with Linear Fractional Functionals, Naval Research Logistics Quarterly, Vol. 9, pp. 181–196, 1962.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by P. L. Yu

This research was partially supported by NRC Research Grant No. A4743. The authors wish to thank two anonymous referees for their helpful comments on an earlier draft of this paper.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Choo, E.U., Atkins, D.R. Bicriteria linear fractional programming. J Optim Theory Appl 36, 203–220 (1982). https://doi.org/10.1007/BF00933830

Download citation

  • Issue Date:

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

Key Words

Navigation