IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-3-032-07860-5_20.html

On Nonsmooth Multiobjective Semi-Infinite Programming with Switching Constraints Using Convexificators

Author

Listed:
  • Rishabh Pandey

    (National Institute of Technology Mizoram, Department of Mathematics)

  • Yogendra Pandey

    (Satish Chandra College, Department of Mathematics)

  • Vinay Singh

    (National Institute of Technology Mizoram, Department of Mathematics)

  • Anjali Rawat

    (National Institute of Technology Mizoram, Department of Mathematics)

Abstract

This work investigates a nonsmooth multiobjective semi-infinite programming problem with switching constraints $$({\mathcal {M}}{\mathcal {S}}{\mathcal {P}}{\mathcal {S}}{\mathcal {C}})$$ ( M S P S C ) . Using convexificators and under the nonsmooth Abadie constraint qualification, we derive necessary optimality conditions in the form of $$\textbf{M}$$ M -stationary. Furthermore, under generalized convexity conditions expressed through the properties of convexificators, we establish sufficient conditions for optimality. For the original $${\mathcal {M}}{\mathcal {S}}{\mathcal {P}}{\mathcal {S}}{\mathcal {C}}$$ M S P S C problem, we formulate a Mond-Weir-type dual model and prove both weak and strong duality results between the primal and dual problems. Finally, numerical examples are provided to demonstrate the applicability of the theoretical findings to $${\mathcal {M}}{\mathcal {S}}{\mathcal {P}}{\mathcal {S}}{\mathcal {C}}$$ M S P S C .

Suggested Citation

  • Rishabh Pandey & Yogendra Pandey & Vinay Singh & Anjali Rawat, 2026. "On Nonsmooth Multiobjective Semi-Infinite Programming with Switching Constraints Using Convexificators," Springer Optimization and Its Applications,, Springer.
    • Handle: RePEc:spr:spochp:978-3-032-07860-5_20
    DOI: 10.1007/978-3-032-07860-5_20
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:spochp:978-3-032-07860-5_20. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.