罚函数法(SUMT)是处理约束优化问题时最常用、也是较为成功的一种方法。
Sequential Unconstrained Minimization Techniques (SUMT) are most common and comparatively successful method in constrained optimization.
提出求解含平衡约束数学规划问题(简记为MPEC问题)的熵函数法。
An entropy function method for solving mathematical programs with equilibrium constraints (MPEC) is proposed in this paper.
同时为了将不等式约束优化问题转化为单目标优化问题，对惩罚函数法进行了改进。
At the mean time, the penalty function was improved by transmuting the inequality constrained optimization problem into single target optimization one.
在组合模型的权重系数求解中，首先对目标函数和等式约束使用拉格朗日乘子法来求解权重系数。
To calculate the weight coefficients of the combination model firstly the Lagrangian multiplier method is applied to object function and equality constrains.
利用GPS水准对模拟大地水准面进行约束，采用“移去——恢复”技术和多面函数法进行拟合内插，得到转换后的大地水准面。
The GPS-levelling is used to add constraints on the simulated geoid, and the "remove-restore" method and the multi-quadric function method are used to interpolation, so as to obtain the refined geoid.
在此基础上研究了利用等式约束与不等式约束的惩罚函数法对平面多杆机构进行尺度最优综合的有关问题。
Some problems of optimum synthesis of planar multi-bar linkages are studied by the penalty function method with equality and inequality constraints.
用该近似函数形成结构优化原问题的序列近似问题，再用约束变尺度法解近似问题。
The improved approximate expressions are proposed to create the sequential approximation problems which are solved with the constrained variable metric method.
填充函数法是一种解无约束全局极小化问题的方法。
The filled function method is an approach for solving unconstrained global minimization problem.
罚函数法将约束条件加到目标函数上，变有约束为无约束，能较易求解该类问题。
But penalty function method can solve this problem easily by adding restrictions to target function, which becomes restrictions to nonrestrictions.
提出了一种快速应用型罚函数法来求解有约束气动优化问题。
A new penalty function method is used for the constrained aerodynamic optimization.
采用惩罚函数法将约束优化转化为无约束优化。
Penalty function method transfer constrained condition into unconstrained condition.
提出了一类解极小极大问题的熵函数法，这种方法也可用来解线性或约束优化问题。
A method for solving minimax problem is presented, which also can be used to solve linear or constrained optimization problems.
设计了求解车辆路径问题一种新的整数编码方案，并采用罚函数法处理约束条件。
A new integer-code method is adopted for the vehicle routing problem, and strained terms in VRP are processed by the penalty function.
同时探讨了接触问题的三种计算方法——拉格朗日乘子法、罚函数法和基于求解器的直接约束法；
The FEM calculate method for contact problem, i. e. LAGRANGE multipliers, penalty methods and direct constrains were discussed.
介绍了通过惩罚函数法解决含约束条件遗传算法的实现问题。
This paper proposes the methods of using punishment function to realize GA with constrains, and then constructing GA program by Matlab tools.
本文运用内罚函数法，使一个在颤振、强度和最小尺度等约束条件下的翼面结构重量取极小值。
In this paper an interior penalty function method is applied to minimize the weight of a wing structure under the constraints of flutter, strength and minimum gage.
本文特混合罚函数法用子这类线性规划问题从而获得满足一定营养素配比的约束条件，使之成为成本最低的最佳配方，为合理营养的配方组成提供理论依据。
Method of mixed penalty function is used for the linear question, optimum prescription is obtained at the conditions in the paper. It provides theory basis for reasonable food nutritive ratio.
本文利用完全线性化方法处理非线性目标函数，用惩罚函数法对拟合参数约束。
In this paper, the non-linear objective function is treated by means of the complete linearization method and the fitting parameters are restricted by using the punished function.
设计了求解车辆路径问题的一种新的实数编码方案，将车辆路径问题转化成准连续优化问题，并采用罚函数法处理约束条件。
The VRP was changed into a quasi-continuous problem by designing a new real coding. Constrained terms in VRP were processed by the penalty function.
结合评价函数法将带约束的多目标优化问题转化为无约束优化问题，并给出相应的区间扩张，对相关定理进行了证明。
The paper, combined with evaluation function introduces the transformation of constrained problems into unconstrained ones, and offers an interval extension.
给出了求解一类具有简单约束的上模集函数最小值问题的一种局部搜索法，并讨论了所给算法的性能保证。
The algorithm is an improved greedy algorithm which combined the part of enumeration method with the greedy algorithm, thus to make it a better performance guarantee.
给出了求解一类具有简单约束的上模集函数最小值问题的一种局部搜索法，并讨论了所给算法的性能保证。
An approximation algorithm is presented for minimizing a nondecreasing supermodular set function, and its performance guarantee is probed.
给出了求解一类具有简单约束的上模集函数最小值问题的一种局部搜索法，并讨论了所给算法的性能保证。
An approximation algorithm is presented for minimizing a nondecreasing supermodular set function, and its performance guarantee is probed.
应用推荐