IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v243y2016i1d10.1007_s10479-015-1814-8.html
   My bibliography  Save this article

On duality for mathematical programs with vanishing constraints

Author

Listed:
  • S. K. Mishra

    (Banaras Hindu University)

  • Vinay Singh

    (National Institute of Technology)

  • Vivek Laha

    (Banaras Hindu University)

Abstract

In this paper, we formulate and study Wolfe and Mond–Weir type dual models for a difficult class of optimization problems known as the mathematical programs with vanishing constraints. We establish the weak, strong, converse, restricted converse and strict converse duality results under the assumptions of convexity and strict convexity between the primal mathematical program with vanishing constraints and the corresponding Wolfe type dual. We also derive the weak, strong, converse, restricted converse and strict converse duality results between the primal mathematical program with vanishing constraints and the corresponding Mond–Weir type dual under the assumptions of pseudoconvex, strict pseudoconvex and quasiconvex functions.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:annopr:v:243:y:2016:i:1:d:10.1007_s10479-015-1814-8
    DOI: 10.1007/s10479-015-1814-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-015-1814-8
    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/s10479-015-1814-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. S. Askar & A. Tiwari, 2009. "First-order optimality conditions and duality results for multi-objective optimisation problems," Annals of Operations Research, Springer, vol. 172(1), pages 277-289, November.
    2. S. Ito & Y. Liu & K.L. Teo, 2000. "A Dual Parametrization Method for Convex Semi-Infinite Programming," Annals of Operations Research, Springer, vol. 98(1), pages 189-213, December.
    3. Hang-Chin Lai & Tone-Yau Huang, 2012. "Nondifferentiable minimax fractional programming in complex spaces with parametric duality," Journal of Global Optimization, Springer, vol. 53(2), pages 243-254, June.
    4. Shashi Kant Mishra & Shouyang Wang & Kin Keung Lai, 2008. "V-Invex Functions and Vector Optimization," Springer Optimization and Its Applications, Springer, number 978-0-387-75446-8, December.
    5. A. Izmailov & A. Pogosyan, 2012. "Active-set Newton methods for mathematical programs with vanishing constraints," Computational Optimization and Applications, Springer, vol. 53(2), pages 425-452, October.
    6. A. F. Izmailov & M. V. Solodov, 2009. "Mathematical Programs with Vanishing Constraints: Optimality Conditions, Sensitivity, and a Relaxation Method," Journal of Optimization Theory and Applications, Springer, vol. 142(3), pages 501-532, September.
    7. 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.
    8. M. Soleimani-damaneh, 2012. "Duality for optimization problems in Banach algebras," Journal of Global Optimization, Springer, vol. 54(2), pages 375-388, October.
    9. Elmor Peterson, 2001. "The Fundamental Relations between Geometric Programming Duality, Parametric Programming Duality, and Ordinary Lagrangian Duality," Annals of Operations Research, Springer, vol. 105(1), pages 109-153, July.
    10. Radu Boţ & André Heinrich, 2014. "Regression tasks in machine learning via Fenchel duality," Annals of Operations Research, Springer, vol. 222(1), pages 197-211, November.
    11. Altannar Chinchuluun & Dehui Yuan & Panos Pardalos, 2007. "Optimality conditions and duality for nondifferentiable multiobjective fractional programming with generalized convexity," Annals of Operations Research, Springer, vol. 154(1), pages 133-147, October.
    12. T.R. Jefferson & C.H. Scott, 2001. "Quality Tolerancing and Conjugate Duality," Annals of Operations Research, Springer, vol. 105(1), pages 185-200, July.
    13. R.T. Rockafellar, 1999. "Duality and optimality in multistagestochastic programming," Annals of Operations Research, Springer, vol. 85(0), pages 1-19, 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. Sajjad Kazemi & Nader Kanzi, 2018. "Constraint Qualifications and Stationary Conditions for Mathematical Programming with Non-differentiable Vanishing Constraints," Journal of Optimization Theory and Applications, Springer, vol. 179(3), pages 800-819, December.
    2. Tamanna Yadav & S. K. Gupta & Sumit Kumar, 2024. "Optimality analysis and duality conditions for a class of conic semi-infinite program having vanishing constraints," Annals of Operations Research, Springer, vol. 340(2), pages 1091-1123, September.
    3. Bhuwan Chandra Joshi & Murari Kumar Roy & Abdelouahed Hamdi, 2024. "On Semi-Infinite Optimization Problems with Vanishing Constraints Involving Interval-Valued Functions," Mathematics, MDPI, vol. 12(7), pages 1-19, March.
    4. Balendu Bhooshan Upadhyay & Arnav Ghosh, 2023. "On Constraint Qualifications for Mathematical Programming Problems with Vanishing Constraints on Hadamard Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 199(1), pages 1-35, October.
    5. Tadeusz Antczak, 2022. "Optimality conditions and Mond–Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints," 4OR, Springer, vol. 20(3), pages 417-442, September.
    6. Yogendra Pandey & S. K. Mishra, 2018. "Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators," Annals of Operations Research, Springer, vol. 269(1), pages 549-564, October.
    7. Vivek Laha & Harsh Narayan Singh, 2023. "On quasidifferentiable mathematical programs with equilibrium constraints," Computational Management Science, Springer, vol. 20(1), pages 1-20, December.
    8. 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.
    9. Ali Sadeghieh & Nader Kanzi & Giuseppe Caristi & David Barilla, 2022. "On stationarity for nonsmooth multiobjective problems with vanishing constraints," Journal of Global Optimization, Springer, vol. 82(4), pages 929-949, April.
    10. Le Thanh Tung, 2022. "Karush–Kuhn–Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints," Annals of Operations Research, Springer, vol. 311(2), pages 1307-1334, April.
    11. Kin Keung Lai & Shashi Kant Mishra & Sanjeev Kumar Singh & Mohd Hassan, 2022. "Stationary Conditions and Characterizations of Solution Sets for Interval-Valued Tightened Nonlinear Problems," Mathematics, MDPI, vol. 10(15), pages 1-16, August.
    12. Tadeusz Antczak, 2023. "On directionally differentiable multiobjective programming problems with vanishing constraints," Annals of Operations Research, Springer, vol. 328(2), pages 1181-1212, September.
    13. Balendu Bhooshan Upadhyay & Arnav Ghosh & Savin Treanţă & Jen-Chih Yao, 2024. "Constraint Qualifications and Optimality Conditions for Multiobjective Mathematical Programming Problems with Vanishing Constraints on Hadamard Manifolds," Mathematics, MDPI, vol. 12(19), pages 1-24, September.

    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. 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.
    2. 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.
    3. 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.
    4. Hachem Slimani & Shashi Kant Mishra, 2014. "Multiobjective Fractional Programming Involving Generalized Semilocally V-Type I-Preinvex and Related Functions," International Journal of Mathematics and Mathematical Sciences, Hindawi, vol. 2014, pages 1-12, May.
    5. S. K. Suneja & Sunila Sharma & Priyanka Yadav, 2018. "Generalized higher-order cone-convex functions and higher-order duality in vector optimization," Annals of Operations Research, Springer, vol. 269(1), pages 709-725, October.
    6. 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.
    7. S. Ito & Y. Liu & K. Teo, 2004. "An Approximation Approach to Non-strictly Convex Quadratic Semi-infinite Programming," Journal of Global Optimization, Springer, vol. 30(2), pages 195-206, November.
    8. Rashed Khanjani Shiraz & Madjid Tavana & Debora Di Caprio & Hirofumi Fukuyama, 2016. "Solving Geometric Programming Problems with Normal, Linear and Zigzag Uncertainty Distributions," Journal of Optimization Theory and Applications, Springer, vol. 170(1), pages 243-265, July.
    9. Tadeusz Antczak, 2023. "On directionally differentiable multiobjective programming problems with vanishing constraints," Annals of Operations Research, Springer, vol. 328(2), pages 1181-1212, September.
    10. A. Auslender & A. Ferrer & M. Goberna & M. López, 2015. "Comparative study of RPSALG algorithm for convex semi-infinite programming," Computational Optimization and Applications, Springer, vol. 60(1), pages 59-87, January.
    11. K. Khazafi & N. Rueda, 2009. "Multiobjective Variational Programming under Generalized Type I Univexity," Journal of Optimization Theory and Applications, Springer, vol. 142(2), pages 363-376, August.
    12. Mohamed Abd El-Hady Kassem & Huda M. Alshanbari, 2023. "Generalizations of Higher-Order Duality for Multiple Objective Nonlinear Programming under the Generalizations of Type-I Functions," Mathematics, MDPI, vol. 11(4), pages 1-20, February.
    13. Chen Ling & Qin Ni & Liqun Qi & Soon-Yi Wu, 2010. "A new smoothing Newton-type algorithm for semi-infinite programming," Journal of Global Optimization, Springer, vol. 47(1), pages 133-159, May.
    14. 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.
    15. 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.
    16. Le Thanh Tung, 2022. "Karush–Kuhn–Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints," Annals of Operations Research, Springer, vol. 311(2), pages 1307-1334, April.
    17. Rashed Khanjani Shiraz & Hirofumi Fukuyama, 2018. "Integrating geometric programming with rough set theory," Operational Research, Springer, vol. 18(1), pages 1-32, April.
    18. R. R. Ota & J. C. Pati & A. K. Ojha, 2019. "Geometric programming technique to optimize power distribution system," OPSEARCH, Springer;Operational Research Society of India, vol. 56(1), pages 282-299, March.
    19. Tadeusz Antczak, 2022. "Optimality conditions and Mond–Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints," 4OR, Springer, vol. 20(3), pages 417-442, September.
    20. 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.

    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:243:y:2016:i:1:d:10.1007_s10479-015-1814-8. 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.