IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v141y2009i1d10.1007_s10957-008-9474-3.html
   My bibliography  Save this article

Higher-Order Duality in Nondifferentiable Minimax Programming with Generalized Type I Functions

Author

Listed:
  • I. Ahmad

    (Aligarh Muslim University)

  • Z. Husain

    (Aligarh Muslim University)

  • S. Sharma

    (Aligarh Muslim University)

Abstract

A unified higher-order dual for a nondifferentiable minimax programming problem is formulated. Weak, strong and strict converse duality theorems are discussed involving generalized higher-order (F,α,ρ,d)-Type I functions.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:joptap:v:141:y:2009:i:1:d:10.1007_s10957-008-9474-3
    DOI: 10.1007/s10957-008-9474-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-008-9474-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-008-9474-3?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. S. K. Mishra & N. G. Rueda, 2006. "Second-Order Duality for Nondifferentiable Minimax Programming Involving Generalized Type I Functions," Journal of Optimization Theory and Applications, Springer, vol. 130(3), pages 479-488, September.
    2. D. H. Yuan & X. L. Liu & A. Chinchuluun & P. M. Pardalos, 2006. "Nondifferentiable Minimax Fractional Programming Problems with (C, α, ρ, d)-Convexity," Journal of Optimization Theory and Applications, Springer, vol. 129(1), pages 185-199, April.
    3. Z. A. Liang & H. X. Huang & P. M. Pardalos, 2001. "Optimality Conditions and Duality for a Class of Nonlinear Fractional Programming Problems," Journal of Optimization Theory and Applications, Springer, vol. 110(3), pages 611-619, September.
    4. 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.
    5. Husain, I. & Hanson, Morgan A. & Jabeen, Z., 2005. "On nondifferentiable fractional minimax programming," European Journal of Operational Research, Elsevier, vol. 160(1), pages 202-217, January.
    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. 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.

    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. Arshpreet Kaur & Mahesh K Sharma, 2022. "Correspondence between a new class of generalized cone convexity and higher order duality," OPSEARCH, Springer;Operational Research Society of India, vol. 59(2), pages 550-560, June.
    2. Anurag Jayswal & Vivek Singh & Krishna Kummari, 2017. "Duality for nondifferentiable minimax fractional programming problem involving higher order $$(\varvec{C},\varvec{\alpha}, \varvec{\rho}, \varvec{d})$$ ( C , α , ρ , d ) -convexity," OPSEARCH, Springer;Operational Research Society of India, vol. 54(3), pages 598-617, September.
    3. Hong Yang & Angang Cui, 2023. "The Sufficiency of Solutions for Non-smooth Minimax Fractional Semi-Infinite Programming with ( B K ,ρ )−Invexity," Mathematics, MDPI, vol. 11(20), pages 1-13, October.
    4. X. J. Long, 2011. "Optimality Conditions and Duality for Nondifferentiable Multiobjective Fractional Programming Problems with (C,α,ρ,d)-convexity," Journal of Optimization Theory and Applications, Springer, vol. 148(1), pages 197-208, January.
    5. D. H. Yuan & X. L. Liu & A. Chinchuluun & P. M. Pardalos, 2006. "Nondifferentiable Minimax Fractional Programming Problems with (C, α, ρ, d)-Convexity," Journal of Optimization Theory and Applications, Springer, vol. 129(1), pages 185-199, April.
    6. 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.
    7. 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.
    8. P. Khanh & L. Tung, 2015. "First- and second-order optimality conditions for multiobjective fractional programming," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(2), pages 419-440, July.
    9. 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.
    10. 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.
    11. Washington Alves Oliveira & Marko Antonio Rojas-Medar & Antonio Beato-Moreno & Maria Beatriz Hernández-Jiménez, 2019. "Necessary and sufficient conditions for achieving global optimal solutions in multiobjective quadratic fractional optimization problems," Journal of Global Optimization, Springer, vol. 74(2), pages 233-253, June.
    12. 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.
    13. Ramu Dubey & Vishnu Narayan Mishra & Rifaqat Ali, 2019. "Duality for Unified Higher-Order Minimax Fractional Programming with Support Function under Type-I Assumptions," Mathematics, MDPI, vol. 7(11), pages 1-12, November.
    14. 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.
    15. 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.
    16. S. Mishra & S. Wang & K. Lai, 2008. "Optimality and duality for a nonsmooth multiobjective optimization involving generalized type I functions," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 67(3), pages 493-504, June.
    17. Xiaojun Lei & Zhian Liang, 2008. "Study on the Duality between MFP and ACP," Modern Applied Science, Canadian Center of Science and Education, vol. 2(6), pages 1-81, November.
    18. 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.
    19. Altannar Chinchuluun & Panos Pardalos, 2007. "A survey of recent developments in multiobjective optimization," Annals of Operations Research, Springer, vol. 154(1), pages 29-50, October.
    20. V. Jeyakumar & G. Y. Li, 2011. "Robust Duality for Fractional Programming Problems with Constraint-Wise Data Uncertainty," Journal of Optimization Theory and Applications, Springer, vol. 151(2), pages 292-303, 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:joptap:v:141:y:2009:i:1:d:10.1007_s10957-008-9474-3. 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.