Abstract
In this paper, we study the duality theorems of a nondifferentiable semi-infinite interval-valued optimization problem with vanishing constraints (IOPVC). By constructing the Wolfe and Mond–Weir type dual models, we give the weak duality, strong duality, converse duality, restricted converse duality, and strict converse duality theorems between IOPVC and its corresponding dual models under the assumptions of generalized convexity.
Highlights
In recent years, the mathematical programming problems with vanishing constraints (MPVCs) have been studied extensively by many scholars
Achtziger and Kanzow [1] first proposed an optimization problem with vanishing constraints (MPVCs) and gave the strong stationary point theorem and VC-stationary point theorem of MPVCs under Abadie constraint qualification (ACQ) and improved ACQ assumptions
The study of dual problems related to MPVCs has been used as a tool to solve optimization problems in various fields in the past decades, such as variational problems, fractional programming problems, semi-infinite programming problems, complex minimax problems, and so on
Summary
The mathematical programming problems with vanishing constraints (MPVCs) have been studied extensively by many scholars. Theorem 2.1 Let x ∈ E be a locally weakly LU optimal solution of (IOPVC) such that (VC-ACQ) holds at xand
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
