Abstract
Asymptotic extensions of the Kuhn-Tucker conditions, in which both the adjoint equation and the complementary slackness condition are solved asymptotically, are given for vector-valued mathematical programming problems in locally convex spaces. Under appropriate hypotheses, the conditions are both necessary and sufficient for optimality. In particular, they characterize optimality for linear programs. An asymptotic dual program is also given.