本文利用目标函数和约束函数的线性下界估计，提出一种求(SGP)问题全局解的线性松弛方法。
By utilizing the linear underestimation of objective and constraint functions, a linear relaxation method is proposed for finding global solution of SGP.
本文提出了一个解不等式约束非线性规划问题的有效方法。
A new efficient method for solving nonlinear programming problem is studied in this paper.
本文给出了用代理约束选取混合整数线性规划问题初始可行解的一种方法。
In this paper, a method using surrogate constraint to select an initial feasible solution of a mixed integer linear programming problem is presented.
由于该时序逻辑综合新方法在处理过程中要涉及解大型覆盖表的问题，为此提出满足压缩状态表约束关系的状态分配的简化算法。
This method, based on combinational logic minimization, proposes a new idea to proceed state assignment according to constrained. relation of compressed state table.
结合线性规划求解全部最优解的需要，讨论了具有某些约束条件时的实现方法。
With the purpose to find all optimal solution in linear programming, author also discuss the method under some restraint condition.
针对这一问题，文章提出了求非负变量等式约束基本可行解的一种方法。
In this paper, the authors establish a new method of finding the base feasible solution for linear program subject to non-negative variables and equality constraints.
本文提出一种解线性约束凸规划的数值方法。
This paper presents an interior trust region method for linear constrained LC convex optimization problems.
本文提出一类新的解无约束最优化问题的信赖域方法。
In this paper, we propose a new class of trust region methods for nonlinear optimization problems.
以模糊集合理论为基础，提出了最小不确定度约束下的极大可能性估计准则、解算方法和迭代步骤。
Based on the theory of fuzzy set, the paper presents a new method of parameter estimation-maximum possibility estimation restricted by least uncertainty.
提出了一类解极小极大问题的熵函数法，这种方法也可用来解线性或约束优化问题。
A method for solving minimax problem is presented, which also can be used to solve linear or constrained optimization problems.
本文提出了一个解线性等式约束优化问题的新锥模型信赖域方法。
In this paper, a trust region method with new conic model for linearly constrained optimization problems is proposed.
转轴直径搜索可行方向法(DSFD方法)是一种比较有效的求解有约束非线性规划问题的算法，但它只能得到局部最优解。
Direct search feasible direction (DSFD) is an effective algorithm for solving the constrained non-linear programming problem, however, it could only find the local optimal solution.
为了获得稳定而满意的解，我们采用直方图约束下的正则化方法对连续近似迭代进行约束。
To obtain a stable solution, in our method, successive approximation process is constrained by prior histogram and laplacian regularization.
配置法是以满足纯插值约束条件的方式，寻求算子方程近似解的方法，且具有无需计算数值积分、计算量小、收敛阶高等优点。
The collocation method is a numerical method which search for the approximate solution of the equation by way of meeting pure interpolation condition.
填充函数法是一种解无约束全局极小化问题的方法。
The filled function method is an approach for solving unconstrained global minimization problem.
在正交化技术的基础上，本文提出了一种适合于无约束弹性结构主动控制分析的计算解耦方法。
On the basis of orthorhombic techniques, a computational decoupling method which can be used in the active control analysis of unrestricted elastic structures is brought forward in this paper.
提出具有模糊需求量和模糊能力约束以及资本水平约束的多品种类集约生产计划问题的模糊优化模型及模糊解方法。
This paper focuses on a fuzzy approach in modeling and optimization for aggregate production planning problems with multiproduct under fuzzy requirements and fuzzy capacities environment.
通过对运输问题的约束条件的分析，重新设计了初始种群的生成方法，避免了对大量非可行解的处理。
It proposes a method to product initial feasible solutions of transportation problem, on the basis of its special constrained conditions, and the unfeasible solutions need not to care any more.
在将几何约束问题的约束方程组转化为优化模型的时候，需要找到一种方法来跳出局部最优解，进而找到全局最优解。
When transferring a geometric constraint equation group into an optimization model, we need a method to jump out of the local beat solution so that we can find a best global solution.
许多算法采用引入惩罚函数降低适应度方法使其满足等式约束条件，但太难收敛或解根本不满足约束条件，因此它是遗传算法的一个瓶颈。
It is solved by using penalty function to decrease fitness, but it is too difficult to convergence or to satisfy constrained equations. Therefore constrained equation is a bottleneck for this GA.
本文采用新的弹性约束项，得到的优化方程不但容易计算而且有明确的物理意义，本文讨论了用有限差分法解这个方程的方法，对于复杂形状的轮廓匹配可以用多尺度法来解决。
The solution method is based on a finite difference approach, for which we present convergence characteristics. A multi-smoothing scheme is proposed to improve the convergence of the matching process.
给出用计算机代数系统Mathematica建立Yang -Baxter方程解的统一方法，此方法可用于具有动力r -矩阵的约束系统。
A unifying method for constructing the solutions to the Yang-Baxter equation by using the computer algebraic system Mathematica is presented.
给出用计算机代数系统Mathematica建立Yang -Baxter方程解的统一方法，此方法可用于具有动力r -矩阵的约束系统。
A unifying method for constructing the solutions to the Yang-Baxter equation by using the computer algebraic system Mathematica is presented.
应用推荐