Higher Order Invexity and Duality in Mathematical Programming
Higher Order Invexity and Duality in Mathematical Programming
复制标题
DOI：
10.1007/978-1-4613-3341-8_17
复制
发表时间：
1998
影响因子：
5.2
通讯作者：
B. Mond;J. Zhang
中科院分区：
文献类型：
--
作者：
B. Mond;J. Zhang
他没有证明弱对偶，因此只给了一个有限的强对偶定理。随后，Mond和Weir给出了完全对偶性的条件，并制定了其他高阶对偶。在这里，我们给出了不变凸型的条件下，对偶之间保持上述问题和各种高阶对偶规划问题。
He did not prove weak duality and hence only gave a limited strong duality theorem. Subsequently, Mond and Weir gave conditions for full duality and, as well, formulated other higher order duals. Here we give invexity type conditions under which duality holds between the above problem and various higher order dual programming problems.