New Constraint Qualification and Optimality for Linear Semi-Infinite Programming

In this short paper, we present a new constraint qualification (CQ) for linear semi-infinite programming (LSIP) called directional Farkas-Minkowski CQ that characterizes the class of all LSIP problems for which a feasible solution is optimal if and only if it satisfies the classical optimality conditions. Furthermore, presented in terms of the new CQ, an new form of some recent optimality conditions without CQ for LSIP is obtained.