作者: V. Jeyakumar , A. Zaffaroni
DOI: 10.1080/01630569608816697
关键词:
摘要: In this paper, we establish necessary and sufficient dual conditions for weak proper minimality of infinite dimensional vector convex programming problems without any regularity conditions. The optimality are given in asymptotic forms using epigraphs conjugate functions sub differentials, It is shown how these yield standard Lagrangian under appropriate main tool, used to obtain results, a new solvability result Motzkin type cone systems. We also provide local certain non—convex approximations