New Farkas-type constraint qualifications in convex infinite programming

¹ Department of Mathematics, International University, Vietnam National University-HCM city, Linh Trung ward, Thu Duc district, Ho Chi Minh city, Vietnam.
² Department of Statistics and Operations Research, University of Alicante, 03080 Alicante, Spain; Marco.Antonio@ua.es
³ Nha Trang College of Education, Nha Trang, Vietnam.

Received: 2 January 2006

Abstract

This paper provides KKT and saddle point optimality conditions, duality theorems and stability theorems for consistent convex optimization problems posed in locally convex topological vector spaces. The feasible sets of these optimization problems are formed by those elements of a given closed convex set which satisfy a (possibly infinite) convex system. Moreover, all the involved functions are assumed to be convex, lower semicontinuous and proper (but not necessarily real-valued). The key result in the paper is the characterization of those reverse-convex inequalities which are consequence of the constraints system. As a byproduct of this new versions of Farkas' lemma we also characterize the containment of convex sets in reverse-convex sets. The main results in the paper are obtained under a suitable Farkas-type constraint qualifications and/or a certain closedness assumption.