We present some Farkas-type results for inequality
systems involving finitely many convex constraints as well as
convex max-functions. Therefore we use the dual of a minmax
optimization problem. The main theorem and its consequences allows us to establish, as particular instances, some set
containment characterizations and to rediscover some famous theorems of the alternative.
Keywords:
duality, Farkas-type results, minmax programming,
set containment, theorems of the alternative