说明:双击或选中下面任意单词,将显示该词的音标、读音、翻译等;选中中文或多个词,将显示翻译。
您的位置:首页 -> 词典 -> 弱对偶和对偶
1)  Weak dual and dual
弱对偶和对偶
2)  Weak duality
弱对偶
1.
Using Non-fuzzy multiobjectice programming, we introduce one Mond-Weir type of dual model, and prove the corresponding theorems of Weak duality, direct duality and deverse duality.
本文研究具有Fuzzy约束的非光滑Fuzzy多目标规划 (FVP) ,利用分明多目标规划建立了 (FVP)的Mond-Weir型对偶模型 ,得到了Fuzzy有效解的弱对偶、直接对偶和逆对偶定理。
2.
The weak duality and the strong one are obtained under the(F,α,ρ,d)-convexity.
在(F,α,ρd)-凸的基础上讨论了Wolfe向量对偶,并获得了弱对偶和强对偶定理。
3.
The duality theory is the basic theory for mathematical planning in which the study of weak duality theorem under different controlling conditions is an important part of duality theorem research.
对偶理论是数学规划的理论基础,其中在各种约束条件下对弱对偶定理的研究是对偶理论研究的重要组成部分。
3)  weakly dual basis
弱对偶基
4)  Weak(strong) duality
强(弱)对偶
5)  less(much) dual
弱(强)对偶
6)  weak duality
弱对偶性
1.
The paper sets up a new dual problem of a nondifferentiable convex programming problem and proves its dual properties such as weak duality, strong duality and converse duality.
本文对非可微凸规划问题建立了一个新的对偶问题 ,并证明其对偶性质 ,如弱对偶性 ,强对偶性及逆对偶性。
2.
In this paper,we set up a new dual problem for nondifferentiable convex programming which is different from well known dual problems and prove the weak duality and the strong duality.
文章建立关于非可微凸规划的一个新的对偶问题,它不同于已知的对偶问题,文中证明了弱对偶性及强对偶性。
3.
This paper sets up a dual problem for nondifferentiable convex programming with equality constraints and proves the weak duality and strong duality.
本文建立带有等式约束的非可微凸规划的新的对偶问题,证明了其弱对偶性及强对偶性,并讨论了强对偶性与 Lagrange 因子的关系。
补充资料:对偶
修辞方式,用对称的字句加强语言的效果。如:下笔千言,离题万里。沉舟侧畔千帆过,病树前头万木春。参看〖律诗〗、〖骈文〗。
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条