Abstract
In this paper we study the following infinite-dimensional programming problem: (P) μ≔inff0(x), subject tox∈C,fi(x)≤0,i∈I, whereI is an index set with possibly infinite cardinality andC is an infinite-dimensional set. Zero duality gap results are presented under suitable regularity hypotheses for convex-like (nonconvex) and convex infinitely constrained program (P). Various properties of the value function of the convex-like program and its connections to the regularity hypotheses are studied. Relationships between the zero duality gap property, semicontinuity, and e-subdifferentiability of the value function are examined. In particular, a characterization for a zero duality gap is given, using the e-subdifferential of the value function without convexity.
Sign-in/Register to access full text options 
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.
