Optimality criterion for semi-infinite programming problems with faithfully convex constraint functions

Convex semi-infinite programming problem with polyhedral index sets and faithfully convex constraint functions are considered. An explicit optimality criterion is formulated and proved for the given class of problems. A comparative analysis of this criterion with known optimality conditions is performed. An illustrative example is presented.