On semi-infinite minmax programming with generalized invexity
Maria Viorica Ştefănescu, Anton Stefanescu · Optimization · 2011
Here, we consider the minmax programming problem with a set of restrictions indexed in a compact. As a novelty, we obtain optimality criteria of the Kuhn--Tucker type involving a limited number of restrictions and prove both necessity and sufficiency under new weaker invexity assumptions. Also some dual problems are introduced and it is proved that the weak and strong duality properties hold within the same environment.