期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
A Different Approach to Cone-Convex Optimization
1
作者 Surjeet Kaur Suneja Sunila Sharma +1 位作者 meetu b. grover Malti Kapoor 《American Journal of Operations Research》 2013年第6期536-541,共6页
In classical convex optimization theory, the Karush-Kuhn-Tucker (KKT) optimality conditions are necessary and sufficient for optimality if the objective as well as the constraint functions involved is convex. Recently... In classical convex optimization theory, the Karush-Kuhn-Tucker (KKT) optimality conditions are necessary and sufficient for optimality if the objective as well as the constraint functions involved is convex. Recently, Lassere [1] considered a scalar programming problem and showed that if the convexity of the constraint functions is replaced by the convexity of the feasible set, this crucial feature of convex programming can still be preserved. In this paper, we generalize his results by making them applicable to vector optimization problems (VOP) over cones. We consider the minimization of a cone-convex function over a convex feasible set described by cone constraints that are not necessarily cone-convex. We show that if a Slater-type cone constraint qualification holds, then every weak minimizer of (VOP) is a KKT point and conversely every KKT point is a weak minimizer. Further a Mond-Weir type dual is formulated in the modified situation and various duality results are established. 展开更多
关键词 CONVEX Optimization Cone-Convex FUNCTIONS KKT Conditions DUALITY
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部