IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v133y2005i1p47-6110.1007-s10479-004-5023-0.html
   My bibliography  Save this article

Parameter-Free Dual Models for Fractional Programming with Generalized Invexity

Author

Listed:
  • Jin-Chirng Lee
  • Hang-Chin Lai

Abstract

By parameter-free approach, we establish sufficient optimality conditions for nondifferentiable fractional variational programming under certain specific structure of generalized invexity. Employing the sufficient optimality conditions, two parameter-free dual models are formulated. The weak duality, strong duality and strict converse duality theorems are proved in the framework of generalized invexity. Copyright Springer Science + Business Media, Inc. 2005

Suggested Citation

  • Jin-Chirng Lee & Hang-Chin Lai, 2005. "Parameter-Free Dual Models for Fractional Programming with Generalized Invexity," Annals of Operations Research, Springer, vol. 133(1), pages 47-61, January.
    • Handle: RePEc:spr:annopr:v:133:y:2005:i:1:p:47-61:10.1007/s10479-004-5023-0
    DOI: 10.1007/s10479-004-5023-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-004-5023-0
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-004-5023-0?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. H. C. Lai & J. C. Liu & K. Tanaka, 1999. "Duality Without a Constraint Qualification for Minimax Fractional Programming," Journal of Optimization Theory and Applications, Springer, vol. 101(1), pages 109-125, April.
    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. Thai Chuong & Do Kim, 2014. "Optimality conditions and duality in nonsmooth multiobjective optimization problems," Annals of Operations Research, Springer, vol. 217(1), pages 117-136, June.
    2. H. C. Lai & T. Y. Huang, 2008. "Minimax Fractional Programming for n-Set Functions and Mixed-Type Duality under Generalized Invexity," Journal of Optimization Theory and Applications, Springer, vol. 139(2), pages 295-313, November.
    3. Qingjie Hu & Jiguang Wang & Yu Chen, 2020. "New dualities for mathematical programs with vanishing constraints," Annals of Operations Research, Springer, vol. 287(1), pages 233-255, April.
    4. 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.
    5. S. K. Mishra & Vinay Singh & Vivek Laha, 2016. "On duality for mathematical programs with vanishing constraints," Annals of Operations Research, Springer, vol. 243(1), pages 249-272, August.
    6. Thai Doan Chuong & Do Sang Kim, 2017. "Nondifferentiable minimax programming problems with applications," Annals of Operations Research, Springer, vol. 251(1), pages 73-87, April.
    7. Thai Doan Chuong & Do Sang Kim, 2016. "A class of nonsmooth fractional multiobjective optimization problems," Annals of Operations Research, Springer, vol. 244(2), pages 367-383, September.
    8. S. Nobakhtian & M. R. Pouryayevali, 2012. "Optimality Conditions and Duality for Nonsmooth Fractional Continuous-Time Problems," Journal of Optimization Theory and Applications, Springer, vol. 152(1), pages 245-255, 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. Jeyakumar, V. & Li, G.Y. & Srisatkunarajah, S., 2013. "Strong duality for robust minimax fractional programming problems," European Journal of Operational Research, Elsevier, vol. 228(2), pages 331-336.
    2. V. Jeyakumar & J. Vicente-Pérez, 2014. "Dual Semidefinite Programs Without Duality Gaps for a Class of Convex Minimax Programs," Journal of Optimization Theory and Applications, Springer, vol. 162(3), pages 735-753, September.
    3. H. C. Lai & T. Y. Huang, 2008. "Minimax Fractional Programming for n-Set Functions and Mixed-Type Duality under Generalized Invexity," Journal of Optimization Theory and Applications, Springer, vol. 139(2), pages 295-313, November.

    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:annopr:v:133:y:2005:i:1:p:47-61:10.1007/s10479-004-5023-0. 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.