Optimality conditions for nonlinear infinite programming problems

Abstract

An infinite programming problem consists in minimizing a functional defined on a real Banach space under an infinite number of constraints. The main purpose of this article is to provide sufficient conditions of optimality under generalized convexity assumptions. Such conditions are necessarily satisfied when the problem possesses the property that every stationary point is a global minimizer.