一类非光滑优化问题的最优性与对偶（英文）

本文研究了一类带等式和不等式约束的非光滑多目标优化问题,给出了该类问题的Karush-Kuhn-Tucker最优性必要条件和充分条件,建立了该类规划问题的一类混合对偶模型的弱对偶定理、强对偶定理、逆对偶定理、严格逆对偶定理和限制逆对偶定理.     

E-凸多目标规划的最优性及Wolfe型对偶

先引入了一类带不等式和等式约束的E-凸多目标优化问题(MP),给出了该类问题的一个最优性充分条件;其次,建立了该类规划问题(MP)的一类Wolfe型对偶模型(WD),并在E-凸条件下,获得了弱对偶定理,强对偶定理和逆对偶定理.     

含有BF—I函数的多目标变分问题的混合对偶性

在有效解的意义下,对一类含有BF—I函数的多目标变分问题给出了混合型对偶的强对偶定理、弱对偶定理和严格逆对偶定理。     

具V-不变凸性的一类多目标控制问题的混合对偶性

本文研究了一类多目标控制问题的混合对偶性.利用函数的广义V-不变凸性条件,得出了关于有效解的弱对偶定理、强对偶定理和严格逆对偶定理,推广了多目标控制问题的对偶性结论.     

一类锥约束多目标优化问题的高阶对偶研究

在一类锥约束单目标优化问题的一阶对偶模型基础之上,建立了锥约束多目标优化问题的二阶和高阶对偶模型.在广义凸性假设下,给出了弱对偶定理,在Kuhn-Tucker约束品性下,得到了强对偶定理.最后,在弱对偶定理的基础上,利用Fritz-John型必要条件建立了逆对偶定理.     

有端点约束的多目标控制问题的对偶性

考虑一类多目标控制优化问题,这里允许端点在某些曲面上任意地变化.利用控制问题的广义Hamilton函数解的必要条件,构作两种形式的对偶问题模型;在ρ-不变凸假设之下证明了弱对偶定理、强对偶定理和逆对偶定理.     

一类多目标分式规划的二阶对称对偶问题

研究一类多目标分式规划的二阶对称对偶问题.在二阶F-凸性假设下给出了对偶问题的弱对偶、强对偶和逆对偶定理.并在对称和反对称假设下研究了该问题的自身对偶性.     

多目标分式规划逆对偶研究

考虑了一类可微多目标分式规划问题.首先,建立原问题的两个对偶模型.随后,在相关文献的弱对偶定理基础上,利用Fritz John型必要条件,证明了相应的逆对偶定理.     

含有锥约束的多目标变分问题的广义对称对偶性

本文研究了一类含有锥约束多目标变分问题的广义对称对偶性.利用函数的(F,ρ)-不变凸性的条件,得出了多目标变分问题关于有效解的弱对偶定理、强对偶定理和逆对偶定理,将多目标变分问题的对称对偶性理论推广到含有锥约束的广义对称对偶性上来.     

非光滑半无限多目标规划近似解的对偶和鞍点定理

本文利用切向次微分研究了一类非光滑半无限多目标规划问题,并讨论了它的对偶定理和鞍点定理.首先,建立了半无限多目标规划问题的Mond-Weir型对偶,在广义凸性假设下,获得了半无限多目标规划问题近似解的弱对偶、强对偶和逆对偶定理.其次,定义了向量值拉格朗日函数的ε-拟鞍点,获得了ε-拟鞍点的必要和充分条件.这些结论推广和改进了文献中的相应结果.最后以具体的例子来说明了本文的结论.     

广义凸多目标规划的Mond─Weir型对偶性

本文研究带不等式和等式约束的多目标规划的Ｍｏｎｄ－Ｗｅｉｒ型对偶性理论。在目标和约束是广义凸的假设下，证明了弱对偶定理、直接对偶定理以及逆对偶定理     

Duality in nonlinear programming

In this paper are defined new first- and second-order duals of the nonlinear programming problem with inequality constraints. We introduce a notion of a WD-invex problem. We prove weak, strong, converse, strict converse duality, and other theorems under the hypothesis that the problem is WD-invex. We obtain that a problem with inequality constraints is WD-invex if and only if weak duality holds between the primal and dual problems. We introduce a notion of a second-order WD-invex problem with inequality constraints. The class of WD-invex problems is strictly included in the class of second-order ones. We derive that the first-order duality results are satisfied in the second-order case.     

锥约束多目标规划的二阶对称对偶性质

给出一对锥约束多目标非线性规划的二阶对称对偶问题,以及二阶F凸函数类的概念.在二阶F凸假设下证明了真有效解的对偶性质———弱对偶性、强对偶性及逆对偶性.     

Second order symmetric duality in multiobjective programming

A pair of Mond–Weir type multiobjective second order symmetric dual programs are formulated without non-negativity constraints. Weak duality, strong duality and converse duality theorems are established under η-bonvexity and η-pseudobonvexity assumptions. A second order self-duality theorem is given by assuming the functions involved to be skew-symmetric.     

带消失约束的区间值优化问题的最优性条件与对偶定理

本文考虑一类带消失约束的非光滑区间值优化问题(IOPVC)。在一定的约束条件下得到了问题(IOPVC)的LU最优解的必要和充分性最优性条件,研究了其与Mond-Weir型对偶模型和Wolfe型对偶模型之间的弱对偶,强对偶和严格逆对偶定理,并给出了一些例子来阐述我们的结果。     

More on subgradient duality

A duality theorem of P. Wolfe for nonlinear differential programming has been extended by the author to the non-differentiable case by replacing gradients by subgradients. In this paper this extended result is improved by allowing additional types of constraints. Also a converse duality theorem is proved.     

Converse duality in nonlinear programming with cone constraints

The purpose of this paper is to establish various converse duality results for nonlinear programming with cone constraints and its four dual models introduced by Chandra and Abha [S. Chandra, Abha, A note on pseudo-invex and duality in nonlinear programming, European Journal of Operational Research 122 (2000) 161–165].     

Higher-order Mond-Weir converse duality in multiobjective programming involving cones

In this work,we established a converse duality theorem for higher-order Mond-Weir type multiobjective programming involving cones.This flls some gap in recently work of Kim et al.[Kim D S,Kang H S,Lee Y J,et al.Higher order duality in multiobjective programming with cone constraints.Optimization,2010,59:29–43].