IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v7y1999i1p33-70.html
   My bibliography  Save this article

Extensions of Dinkelbach's algorithm for solving non-linear fractional programming problems

Author

Listed:
  • Ricardo Ródenas
  • M. López
  • Doroteo Verastegui

Abstract

No abstract is available for this item.

Suggested Citation

  • Ricardo Ródenas & M. López & Doroteo Verastegui, 1999. "Extensions of Dinkelbach's algorithm for solving non-linear fractional programming problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 7(1), pages 33-70, June.
    • Handle: RePEc:spr:topjnl:v:7:y:1999:i:1:p:33-70
    DOI: 10.1007/BF02564711
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF02564711
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF02564711?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. R. Jagannathan, 1966. "On Some Properties of Programming Problems in Parametric form Pertaining to Fractional Programming," Management Science, INFORMS, vol. 12(7), pages 609-615, March.
    2. S. Arisawa & S. E. Elmaghraby, 1972. "Optimal Time-Cost Trade-Offs in GERT Networks," Management Science, INFORMS, vol. 18(11), pages 589-599, July.
    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. Roberto Baldacci & Andrew Lim & Emiliano Traversi & Roberto Wolfler Calvo, 2020. "Optimal Solution of Vehicle Routing Problems with Fractional Objective Function," Transportation Science, INFORMS, vol. 54(2), pages 434-452, March.

    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. Meena K. Bector & I. Husain & S. Chandra & C. R. Bector, 1988. "A duality model for a generalized minmax program," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(5), pages 493-501, October.
    2. Menipaz, Ehud & Ben-Yair, Avner, 2002. "Three-parametrical harmonization model in project management by means of simulation," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 59(5), pages 431-436.
    3. Vandana Goyal & Namrata Rani & Deepak Gupta, 2022. "An algorithm for quadratically constrained multi-objective quadratic fractional programming with pentagonal fuzzy numbers," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 32(1), pages 49-71.
    4. Tao, Liangyan & Wu, Desheng & Liu, Sifeng & Lambert, James H., 2017. "Schedule risk analysis for new-product development: The GERT method extended by a characteristic function," Reliability Engineering and System Safety, Elsevier, vol. 167(C), pages 464-473.
    5. Meijia Yang & Yong Xia & Jiulin Wang & Jiming Peng, 2018. "Efficiently solving total least squares with Tikhonov identical regularization," Computational Optimization and Applications, Springer, vol. 70(2), pages 571-592, June.
    6. Garrido, Rodrigo A. & Bronfman, Andrés C., 2017. "Equity and social acceptability in multiple hazardous materials routing through urban areas," Transportation Research Part A: Policy and Practice, Elsevier, vol. 102(C), pages 244-260.
    7. Agarwal, Deepika & Singh, Pitam & El Sayed, M.A., 2023. "The Karush–Kuhn–Tucker (KKT) optimality conditions for fuzzy-valued fractional optimization problems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 205(C), pages 861-877.
    8. Azaron, Amir & Tavakkoli-Moghaddam, Reza, 2007. "Multi-objective time-cost trade-off in dynamic PERT networks using an interactive approach," European Journal of Operational Research, Elsevier, vol. 180(3), pages 1186-1200, August.
    9. Aneja, Y. P. & Kabadi, S. N., 1995. "Ratio combinatorial programs," European Journal of Operational Research, Elsevier, vol. 81(3), pages 629-633, March.

    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:spr:topjnl:v:7:y:1999:i:1:p:33-70. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.