优化问题

Structure and convexity can be destroyed if it is left to the solver to perform the matching.we could loose the positive semidefinite matrix with an arbitrary matching of the free variables.

这一方法的思路就是把优化问题简化成优化条件，这样求解相对变得容易。不过问题也就出在这，这一转化需要很强的假设条件。

Considering the fact that the self constraints of the design variables can be formulated as the linear functions in the present process optimization, the nonlinear part of the constraints is dealt by introducing the concept of active constraint set. The linear part is dealt by the gradient projection method specially.

同时考虑到现在的优化求解问题中，设计变量自身的约束可以合理地表示成线性函数的形式，因此对于优化问题的非线性约束部分，通过引入活动约束集的概念进行处理；而对于线性边界约束，则采用梯度投影法作专门处理。

And then the network algarithm of the fundamental MAN optimization is suggested on the grounds of the complementary slackness conditions of linear programming.

因此多属性网络优化问题的分解算法的核心是基本多属性网络的优化问题。

We pointed out the main distinctions between strong singularity problems in topology optimization and those which only have weak singularities.

详细论述了此类拓扑优化问题与仅具有弱奇异性的拓扑优化问题之间的本质区别。

Based on robust method, it may be reformulated as the tractable multi-objective optimization problem.

采用鲁棒方法将其转化为易处理的确定的多目标优化问题，并给出确定性多目标优化问题Pareto有效解存在的条件。

The Ant Colony Optimization is a kind of bionic optimization based on swarm intelligence,which provides new methods for complex combinatory optimization.

蚁群算法是一种用于求解优化问题的新型模拟进化算法，该算法在许多相当困难的优化问题的求解中体现了极强的寻优能力和较好的性质。

Unfortunately, just the lack of design model to guide software design process of EC brings many issues in practices of EC. It is difficult to design reusable EC software based on the basic structure of EC. For example, the EC software aimed to solve function optimization can't be used to solve combinatory optimization without an overall modification.

由于缺少一个软件设计模型来指导演化算法的软件设计过程，仅从演化计算的基本结构出发设计出的软件很难用来求解不同种类的问题，比如针对函数优化而设计的演化算法不经大幅度的修改就不能够用来求解组合优化问题。

Analyzes the pick-up operation process on the gate side of container yards for import containers, and attributes to a multi-phase optimization problem including the rehandle operation scheduling and the shortest path searching.

分析了集装箱堆场大门一侧对进口集装箱的提箱作业过程，将提箱作业优化问题归结为一个包含倒箱优化和最短路搜索两部分的多阶段决策问题。

In each subperiod,the static rank variance and the static density variance of the population are defined,thus the DMOPs is transformed into several bi-objective static optimization problems by using the static rank variance and the static density variance.

然后把动态多目标优化问题近似地转化成了若干个两个目标的静态优化问题。在给出的一种能自动检测环境变化的应答算子下，提出了一种动态多目标进化算法，同时证明了算法的收敛性。

According to the characteristics of reactive power optimization, a mixed algorithm—tabu search genetic algorithm is proposed in this paper.

针对无功优化问题的特点，本文采用了一种应用于电力系统无功优化问题的混合算法一禁忌遗传算法。

But we don't care about Battlegrounds.

但我们并不在乎沙场中的显露。

Ah! don't mention it, the butcher's shop is a horror.

啊！不用提了。提到肉，真是糟透了。