Abstract
ABSTRACT We present an extended conjugate duality for a generalized semi-infinite programming problem . The extended duality is defined in the context of the absence of convexity of problem , by means of a decomposition into a family of convex subproblems and a conjugate dualization of the subproblems. Under appropriate assumptions, we establish strong extended duality and provide necessary and sufficient optimality conditions for problem . These extended conjugate duality and optimality conditions are new in the literature of generalized semi-infinite programming.
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.
