Zero duality gaps in infinite-dimensional programming (Q1263531)

We study the following infinite-dimensional programming problem \[ (P)\quad \mu:=\inf f_ 0(x),\quad subject\quad to\quad x\in C,\quad f_ i(x)\leq,\quad i\in I, \] where I is an index set with possibly infinite cardinality and C is an infinite-dimensional set. Zero duality gap results are presented under suitable regularity hypotheses for convex- like (nonconvex) and convex infinitely constrained programs (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 \(\epsilon\)- subdifferentiability of the value function are examined. In particular, a characterization for the value function without convexity is given, using the \(\epsilon\)-subdifferential of the value function.