作者: Y. Liu , M.A. Goberna
DOI: 10.1080/02331934.2015.1051533
关键词:
摘要: In this paper, the classical KKT, complementarity and Lagrangian saddle-point conditions are generalized to obtain equivalent characterizing optimality of a feasible solution general linear semi-infinite programming problem without constraint qualifications. The method paper differs from usual convex analysis methods its main idea is rooted in some fundamental properties programming.