A new version of Farkas' lemma is derived for systems involving a reve
rse convex inequality using the epsilon-subdifferential of a convex fu
nction. This result leads to a complete characterization of optimality
for a global convex maximization problem.