Preprint Article Version 1 This version is not peer-reviewed

Lagrange Duality and Saddle Point Optimality Conditions for Nonsmooth Interval-Valued Multiobjective Semi-infinite Programming Problems with Vanishing Constraints

Version 1 : Received: 18 July 2024 / Approved: 19 July 2024 / Online: 19 July 2024 (10:53:20 CEST)

How to cite: Upadhyay, B. B.; Sain, S.; Stancu-Minasian, I. Lagrange Duality and Saddle Point Optimality Conditions for Nonsmooth Interval-Valued Multiobjective Semi-infinite Programming Problems with Vanishing Constraints. Preprints 2024, 2024071566. https://doi.org/10.20944/preprints202407.1566.v1 Upadhyay, B. B.; Sain, S.; Stancu-Minasian, I. Lagrange Duality and Saddle Point Optimality Conditions for Nonsmooth Interval-Valued Multiobjective Semi-infinite Programming Problems with Vanishing Constraints. Preprints 2024, 2024071566. https://doi.org/10.20944/preprints202407.1566.v1

Abstract

In this article, we consider a class of nonsmooth interval-valued multiobjective semi-infinite programming problems with vanishing constraints (in short, NIMSIPVC). We introduce the VC-Abadie constraint qualification (in short, VC-ACQ) for NIMSIPVC and employ it to establish Karush-Kuhn-Tucker (in short, KKT)-type necessary optimality conditions. Related to NIMSIPVC, we formulate interval-valued vector Lagrange type dual and scalarized Lagrange type dual problems. Subsequently, we establish weak, strong, and converse duality results relating NIMSIPVC and corresponding dual problems. In addition, we introduce the notions of saddle points for interval-valued vector Lagrangian and scalarized Lagrangian of NIMSIPVC. Moreover, we establish the saddle point optimality criteria for NIMSIPVC. Various non-trivial examples are provided to demonstrate the validity of established results. To the best of our knowledge, optimality conditions, Lagrange type duality, and saddle point optimality criteria for NIMSIPVC have not been investigated yet via Clarke subdifferentials.

Keywords

Interval-valued multiobjective programming; vanishing constraints; Clarke subdifferential; Lagrange duality; saddle point

Subject

Computer Science and Mathematics, Applied Mathematics

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.