Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities

Abstract

In this paper we present constraint qualifications which completely characterize the Farkas–Minkowski and the locally Farkas–Minkowski convex (possibly infinite) inequality systems posed in topological vector spaces. The number of constraints and the dimension of the linear space are arbitrary (possibly infinite). The constraint qualifications considered in this paper are expressed in terms of the solvability of certain parametric convex (linear) systems and the uniform strong duality or the uniform min–max duality relative to the Lagrange (Haar) dual problems of suitable convex (linear) parametric optimization problems.