IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v54y2012i2p295-306.html
   My bibliography  Save this article

Duality on a nondifferentiable minimax fractional programming

Author

Listed:
  • Hang-Chin Lai
  • Hui-Mei Chen

Abstract

We establish the necessary and sufficient optimality conditions on a nondifferentiable minimax fractional programming problem. Subsequently, applying the optimality conditions, we constitute two dual models: Mond-Weir type and Wolfe type. On these duality types, we prove three duality theorems—weak duality theorem, strong duality theorem, and strict converse duality theorem. Copyright Springer Science+Business Media, LLC. 2012

Suggested Citation

  • Hang-Chin Lai & Hui-Mei Chen, 2012. "Duality on a nondifferentiable minimax fractional programming," Journal of Global Optimization, Springer, vol. 54(2), pages 295-306, October.
    • Handle: RePEc:spr:jglopt:v:54:y:2012:i:2:p:295-306
    DOI: 10.1007/s10898-010-9631-8
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-010-9631-8
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-010-9631-8?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. I. Ahmad & Z. Husain, 2006. "Optimality Conditions and Duality in Nondifferentiable Minimax Fractional Programming with Generalized Convexity," Journal of Optimization Theory and Applications, Springer, vol. 129(2), pages 255-275, May.
    2. J. C. Chen & H. C. Lai & S. Schaible, 2005. "Complex Fractional Programming and the Charnes-Cooper Transformation," Journal of Optimization Theory and Applications, Springer, vol. 126(1), pages 203-213, July.
    Full references (including those not matched with items on IDEAS)

    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. Laura Carosi & Laura Martein, 2008. "A sequential method for a class of pseudoconcave fractional problems," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 16(2), pages 153-164, June.
    2. Jiawei Chen & Suliman Al-Homidan & Qamrul Hasan Ansari & Jun Li & Yibing Lv, 2021. "Robust Necessary Optimality Conditions for Nondifferentiable Complex Fractional Programming with Uncertain Data," Journal of Optimization Theory and Applications, Springer, vol. 189(1), pages 221-243, April.
    3. Sonali & N. Kailey & V. Sharma, 2016. "On second order duality of minimax fractional programming with square root term involving generalized B-(p, r)-invex functions," Annals of Operations Research, Springer, vol. 244(2), pages 603-617, September.
    4. Koushik Das & Savin Treanţă & Tareq Saeed, 2022. "Mond-Weir and Wolfe Duality of Set-Valued Fractional Minimax Problems in Terms of Contingent Epi-Derivative of Second-Order," Mathematics, MDPI, vol. 10(6), pages 1-21, March.
    5. H. C. Lai & J. C. Liu & S. Schaible, 2008. "Complex Minimax Fractional Programming of Analytic Functions," Journal of Optimization Theory and Applications, Springer, vol. 137(1), pages 171-184, April.
    6. I. Ahmad & Z. Husain & S. Sharma, 2009. "Higher-Order Duality in Nondifferentiable Minimax Programming with Generalized Type I Functions," Journal of Optimization Theory and Applications, Springer, vol. 141(1), pages 1-12, April.
    7. Anurag Jayswal & Ashish Kumar Prasad & Krishna Kummari, 2013. "Nondifferentiable Minimax Programming Problems in Complex Spaces Involving Generalized Convex Functions," Journal of Optimization, Hindawi, vol. 2013, pages 1-12, December.

    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:jglopt:v:54:y:2012:i:2:p:295-306. 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.