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 ...

A mixed integer continuous nonlinear model and a solution method for the problem of orthogonally packing identical rectangles within an arbitrary convex region are introduced in the present work. The convex region is assumed ...

Using techniques of convex analysis, we provide a direct proof of a recent characterization of convexity given in the setting of Banach spaces in [J. Saint Raymond, J. Nonlinear Convex Anal., 14 (2013), pp. 253-262]. Our ...