IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v62y2025i3d10.1007_s12597-024-00840-7.html
   My bibliography  Save this article

On multiobjective optimization problems involving higher order strong convexity using directional convexificators

Author

Listed:
  • Prachi Sachan

    (Banaras Hindu University)

  • Vivek Laha

    (Banaras Hindu University)

Abstract

In this paper, we introduce the notion of strong convexity of higher order along continuity directions based on strong convexity of higher order by Lin and Fukushima (Some Exact Penalty Results for Nonlinear Programs and Mathematical Programs with Equilibrium Constraints. J Optim Theory Appl. 2003;118:67–80) and convexity along continuity directions by Dempe and Pilecka (Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming. J Glob Optim. 2015;61:769–788). We characterize strong convexity of higher order along continuity directions of a function using the monotonicity of the associated directional convexificators. We have also studied multiobjective optimization problems involving strongly convex functions of higher order along continuity directions. We use vector variational inequalities of higher order in terms of directional convexificators to identify strict minimizers and semi-strict minimizers for the multiobjective optimization problems.

Suggested Citation

  • Prachi Sachan & Vivek Laha, 2025. "On multiobjective optimization problems involving higher order strong convexity using directional convexificators," OPSEARCH, Springer;Operational Research Society of India, vol. 62(3), pages 1200-1223, September.
    • Handle: RePEc:spr:opsear:v:62:y:2025:i:3:d:10.1007_s12597-024-00840-7
    DOI: 10.1007/s12597-024-00840-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-024-00840-7
    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/s12597-024-00840-7?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

    for a different version of it.

    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:opsear:v:62:y:2025:i:3:d:10.1007_s12597-024-00840-7. 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.