Farkas’ lemma for separable sublinear inequalities without qualifications

We show that the celebrated Farkas lemma for linear inequality systems continues to hold for separable sublinear inequality systems. As a consequence, we establish a qualification-free characterization of optimality for separable sublinear programming problems which include classes of robust linear programming problems. We also deduce that the Lagrangian duality always holds for these programming problems without qualifications.