全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多

 对偶约束 的翻译结果: 查询用时：0.42秒
 在分类学科中查询 所有学科 更多类别查询

 历史查询

 对偶约束
 相似匹配句对
 A dual solvablity for constrained programming 约束规划的对偶可解性 短句来源 Dual problem for nonlinear programming with equality constraints 带有等式约束的非线性规划的对偶问题 短句来源 Dual Hypergroups 对偶超群 短句来源 On Antithesis 浅谈对偶 短句来源 THEORY OF CONSTRAINTS 约束理论 短句来源

我想查看译文中含有：的双语例句

 dual constraints
 Time window and unit capacity: dual constraints on the acquisition of serial information in songbirds We prove the $\mathcal{NP}$-hardness of the optimisation problem defined by dual constraints. The dual constraints are not all linear, but the notion ofdegrees of difficulty is maintained in its geometric programming sense. Ambient, amine-cured epoxy compositions exist within the dual constraints of VOC regulation and the vitrification effect, which limits the ultimate Tg of these materials. The extension of these functionals to the case in which kinematic constraints are presented leads to the useful concept of dual constraints, which can be advantageously employed in treating problems involving contact, impact, and changing topology. 更多
 A new polynomial algorithm due to Karmarkar, N. has received world attention in mathematics sociaty .But some points in this method still need to be improved. This work is an example of such imporovement. A different search direction is derived according to a different optimization principle other than potential function, after applying orthogonal projection to it a new algorithm is obtained.A merit of doing this is that in whole iteration procedure no sliding objective function technique is needed, which is... A new polynomial algorithm due to Karmarkar, N. has received world attention in mathematics sociaty .But some points in this method still need to be improved. This work is an example of such imporovement. A different search direction is derived according to a different optimization principle other than potential function, after applying orthogonal projection to it a new algorithm is obtained.A merit of doing this is that in whole iteration procedure no sliding objective function technique is needed, which is used more frequently in the original method as the approximate solution approaches to the optimum and slows down the speed of convergence.It has been shown that in the new proposed method the value of the objective function approaches to the optimum with the same order of the convergence rate as that of the original Karmarkar's in case of CTX = 0. 本文给出了一个解线性规划问题的Karmarkar算法的变形。根据一个不涉及势函数的优化原则,导出一个新的搜索方向,然后将其正交投影得出本文所给算法。该算法的优点是在整个迭代过程中无须对目标函数值加以限制,无须增加对偶变量和对偶约束,也不必采用滑动目标函数技术,且在最优解邻域内的收敛速度与Karmarkar算法相同。 For a self-dual field described by a Lorentz-invariant lagrangian,theS-matrix element which manifestly includes the self-dual constraint is obtained by usingthe functional integration formulation of light-cone quantization. 对一个由 Lorentz 不变的拉氏量描述的自对偶场系统,利用光锥量子化的泛函积分形式,给出了明显体现自对偶约束的 S 矩阵元. This paper gives a formula solution of positive term geometric programming whose difficulty level is one,and extends it to unconstrained programming.Practical usies proved that the formula solution has many advangages such as convenience,high precision and requring less calculation. 对于难度为１的正项几何规划，在其对偶规划中取ｗ０Ｔ０＝δ作为自由未知量，特对偶约束组化为求解δ的一元高次方程，给出了一个公式解法，并特其推广到无约束的情形．实践表明，该公式解法具有使用方便，计算量小、准确度高等优点． << 更多相关文摘
 相关查询

 CNKI小工具 在英文学术搜索中查有关对偶约束的内容 在知识搜索中查有关对偶约束的内容 在数字搜索中查有关对偶约束的内容 在概念知识元中查有关对偶约束的内容 在学术趋势中查有关对偶约束的内容

 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
2008 CNKI－中国知网

2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社