Abstract
In this paper, we are concerned with a nonsmooth programming problem with inequality constraints. We obtain an optimality condition for Kuhn–Tucker points to be minimizers. Later on, we present necessary and sufficient conditions for weak duality between the primal problem and its mixed type dual, which help us to extend some earlier work from the literature.
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.
