IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v41y2024i02ns0217595923500197.html
   My bibliography  Save this article

Second-Order Optimality Conditions and Duality for Multiobjective Semi-Infinite Programming Problems on Hadamard Manifolds

Author

Listed:
  • Balendu Bhooshan Upadhyay

    (Department of Mathematics, Indian Institute of Technology Patna, India)

  • Arnav Ghosh

    (Department of Mathematics, Indian Institute of Technology Patna, India)

  • I. M. Stancu-Minasian

    (“Gheorghe Mihoc-Caius Iacob†Institute of Mathematical Statistics and Applied Mathematics of the Romanian Academy, Bucharest, Romania)

Abstract

This paper is devoted to the study of multiobjective semi-infinite programming problems on Hadamard manifolds. We consider a class of multiobjective semi-infinite programming problems (abbreviated as MSIP) on Hadamard manifolds. We use the concepts of second-order Karush–Kuhn–Tucker stationary point and second-order Karush–Kuhn–Tucker geodesic pseudoconvexity of the considered problem to derive necessary and sufficient second-order conditions of efficiency, weak efficiency and proper efficiency for MSIP along with certain generalized geodesic convexity assumptions. Moreover, we formulate the second-order Mond–Weir-type dual problem related to MSIP and deduce weak and strong duality theorems relating MSIP and the dual problem. The significance of our results is demonstrated with the help of non-trivial examples. To the best of our knowledge, this is the first time that second-order optimality conditions for MSIP have been studied in Hadamard manifold setting.

Suggested Citation

  • Balendu Bhooshan Upadhyay & Arnav Ghosh & I. M. Stancu-Minasian, 2024. "Second-Order Optimality Conditions and Duality for Multiobjective Semi-Infinite Programming Problems on Hadamard Manifolds," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 41(02), pages 1-26, April.
    • Handle: RePEc:wsi:apjorx:v:41:y:2024:i:02:n:s0217595923500197
    DOI: 10.1142/S0217595923500197
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595923500197
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595923500197?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.

    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:wsi:apjorx:v:41:y:2024:i:02:n:s0217595923500197. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.