IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v89y1996i1p212-214.html
   My bibliography  Save this article

A note on programming problems with linear-plus-linear-fractional objective functions

Author

Listed:
  • Hirche, Joachim

Abstract

No abstract is available for this item.

Suggested Citation

  • Hirche, Joachim, 1996. "A note on programming problems with linear-plus-linear-fractional objective functions," European Journal of Operational Research, Elsevier, vol. 89(1), pages 212-214, February.
    • Handle: RePEc:eee:ejores:v:89:y:1996:i:1:p:212-214
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(96)90080-6
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Chadha, S. S., 1993. "Dual of the sum of a linear and linear fractional program," European Journal of Operational Research, Elsevier, vol. 67(1), pages 136-139, May.
    2. Schaible, Siegfried, 1981. "Fractional programming: Applications and algorithms," European Journal of Operational Research, Elsevier, vol. 7(2), pages 111-120, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Singh, Sanjeet & Gupta, Pankaj & Bhatia, Davinder, 2005. "Multiparametric sensitivity analysis in programming problem with linear-plus-linear fractional objective function," European Journal of Operational Research, Elsevier, vol. 160(1), pages 232-241, January.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Singh, Sanjeet & Gupta, Pankaj & Bhatia, Davinder, 2005. "Multiparametric sensitivity analysis in programming problem with linear-plus-linear fractional objective function," European Journal of Operational Research, Elsevier, vol. 160(1), pages 232-241, January.
    2. João Costa & Maria Alves, 2013. "Enhancing computations of nondominated solutions in MOLFP via reference points," Journal of Global Optimization, Springer, vol. 57(3), pages 617-631, November.
    3. Frenk, J.B.G. & Schaible, S., 2004. "Fractional Programming," Econometric Institute Research Papers ERS-2004-074-LIS, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    4. Yasmine Cherfaoui & Mustapha Moulaï, 2021. "Generating the efficient set of MultiObjective Integer Linear plus Linear Fractional Programming Problems," Annals of Operations Research, Springer, vol. 296(1), pages 735-753, January.
    5. Harold P. Benson, 2006. "Maximizing the ratio of two convex functions over a convex set," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(4), pages 309-317, June.
    6. Abderrahman Bouhamidi & Mohammed Bellalij & Rentsen Enkhbat & Khalid Jbilou & Marcos Raydan, 2018. "Conditional Gradient Method for Double-Convex Fractional Programming Matrix Problems," Journal of Optimization Theory and Applications, Springer, vol. 176(1), pages 163-177, January.
    7. Joaquim Júdice & Valentina Sessa & Masao Fukushima, 2022. "Solution of Fractional Quadratic Programs on the Simplex and Application to the Eigenvalue Complementarity Problem," Journal of Optimization Theory and Applications, Springer, vol. 193(1), pages 545-573, June.
    8. Illes, Tibor & Szirmai, Akos & Terlaky, Tamas, 1999. "The finite criss-cross method for hyperbolic programming," European Journal of Operational Research, Elsevier, vol. 114(1), pages 198-214, April.
    9. Ching-Feng Wen & Hsien-Chung Wu, 2011. "Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems," Journal of Global Optimization, Springer, vol. 49(2), pages 237-263, February.
    10. Hladík, Milan, 2010. "Generalized linear fractional programming under interval uncertainty," European Journal of Operational Research, Elsevier, vol. 205(1), pages 42-46, August.
    11. Ching-Feng Wen & Hsien-Chung Wu, 2012. "Using the parametric approach to solve the continuous-time linear fractional max–min problems," Journal of Global Optimization, Springer, vol. 54(1), pages 129-153, September.
    12. Jiao, Hong-Wei & Liu, San-Yang, 2015. "A practicable branch and bound algorithm for sum of linear ratios problem," European Journal of Operational Research, Elsevier, vol. 243(3), pages 723-730.
    13. Wassila Drici & Fatma Zohra Ouail & Mustapha Moulaï, 2018. "Optimizing a linear fractional function over the integer efficient set," Annals of Operations Research, Springer, vol. 267(1), pages 135-151, August.
    14. Ahlatcioglu, Mehmet & Tiryaki, Fatma, 2007. "Interactive fuzzy programming for decentralized two-level linear fractional programming (DTLLFP) problems," Omega, Elsevier, vol. 35(4), pages 432-450, August.
    15. Frenk, J.B.G. & Schaible, S., 2004. "Fractional Programming," ERIM Report Series Research in Management ERS-2004-074-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    16. Benson, Harold P., 2006. "Fractional programming with convex quadratic forms and functions," European Journal of Operational Research, Elsevier, vol. 173(2), pages 351-369, September.
    17. Ashtiani, Alireza M. & Ferreira, Paulo A.V., 2015. "A branch-and-cut algorithm for a class of sum-of-ratios problems," Applied Mathematics and Computation, Elsevier, vol. 268(C), pages 596-608.
    18. Billionnet, Alain, 2004. "Mixed integer programming for the 0-1 maximum probability model," European Journal of Operational Research, Elsevier, vol. 156(1), pages 83-91, July.
    19. Chergui, M. E-A & Moulai, M., 2007. "An exact method for a discrete multiobjective linear fractional optimization," MPRA Paper 12097, University Library of Munich, Germany, revised 09 Jan 2008.
    20. X. L. Sun & H. Z. Luo & D. Li, 2007. "Convexification of Nonsmooth Monotone Functions1," Journal of Optimization Theory and Applications, Springer, vol. 132(2), pages 339-351, February.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:89:y:1996:i:1:p:212-214. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.