Skip to main content
Log in

An Algorithm to Solve Linear Fractional Bilevel Programming Problem Via Goal Programming

  • Theoretical Paper
  • Published:
OPSEARCH Aims and scope Submit manuscript

Abstract

In this paper an algorithm to solve a Bilevel Programming Problem in which the leader’s and the follower’s both objective functions are linear fractional is developed. The algorithm is based on Preemptive Goal Programming. The Bilevel Programming problem is solved by converting it into a goal programming problem. An example to illustrate it is also presented.

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. Bard, J. F. and Falk, J. E. (1982), “An explicit solution to the multilevel programming problem”, Computers and Operations Research, 8, No. 2, 260–272.

    Google Scholar 

  2. Bard, J. F. (1983), “An algorithm for solving the general bilevel programming problem”, Mathematics of Operations Research, 8, No. 2, 260–272.

    Article  Google Scholar 

  3. Bard, J. F. (1984), “Optimality conditions for the bilevel programming problem”, Naval Research Logistics Quarterly, 31, 13–26.

    Article  Google Scholar 

  4. Bard, J. F. (1985), “Geometric and algorithmic development for a hierarchical planning problem”, European Journal of Operations Research Vol. 19, 372–383.

    Article  Google Scholar 

  5. Bersekas, D. P. and Gafni, E. (1982), “Projection Method for variational inequalities and application to a traffic assignment problem”, Mathematical Programming Study, 17, 139–159.

    Article  Google Scholar 

  6. Bialas, W. F. and Karwan, M. H. (1984), “Two level linear programming”, Management Science, 30, No. 8, 1001–1020.

    Article  Google Scholar 

  7. Candler, W. and Townsley, R. J. (1982), “A linear two level programming problem”, Computers and Operations Research, Vol. 9, No. 1, 59–76.

    Article  Google Scholar 

  8. Harker, P. T. (1988), “Alternative models of spactral competiton”, Operations Research, 34, 410–425.

    Article  Google Scholar 

  9. Ignizio, J. P. (1976), Goal Programming and extensions, Lexington Books, London.

    Google Scholar 

  10. Kornbluth, I. S. H. and Steur, R. E. (1981), “Goal programming with linear fractional criteria”, Euro, J. Op. Res., 8, 58–65.

    Article  Google Scholar 

  11. Marcotte, P. (1983), “Network optimization with continuous control parameters”, Transportation Science, 17, No. 2, 181–197.

    Article  Google Scholar 

  12. Pant, J. C. and Shah, S. (1992), “Linear approach to linear fractional goal programming”, Opsearch, 29, 297–304.

    Google Scholar 

  13. Thirwani, D. and Arora, S. R. (1983), “Bi-Level linear fractional programming problem”, Cahiers Du Cero, 35, No. 1–2, 135–149.

    Google Scholar 

  14. Tobin, R. L. and Friez, T. L. (1986), “Spatial competition facility location models: Definition formulation and solution approach”, Annals of Operations Research 6, 49–74.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Malhotra, N., Arora, S.R. An Algorithm to Solve Linear Fractional Bilevel Programming Problem Via Goal Programming. OPSEARCH 37, 1–13 (2000). https://doi.org/10.1007/BF03398596

Download citation

  • Published:

  • Issue Date:

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

Key words

Mathematics Subject Classification

Navigation