求解

As an NP-hard problem, this model has no solution based on polynomial algorithm at present. Therefore, an adaptive and polymorphic ant colony algorithm has been brought forward to solve the VRPMC.

由于该模型是一个NP-hard问题，目前还没有多项式算法求解，又提出了采用自适应的多态蚁群算法来对其进行求解的策略。

All the sub-plans are described by a group of general mathematic formulae. The computation of the sub- plan can be decomposed into two sub-problems by relaxing the constraint that production level at production period of a sub-plan must be more than zero. Based on the properties of an optimal solution, two polynomial algorithms are devised to solve sub-problems and reintegrate the relaxed constraint. Finally, a dynamic programming algorithm with complexity O(T^4) is developed to solve the global problem, where T is number of periods in planning horizon.

给出了所有子计划的通用数学描述，并通过松弛正生产量约束将子计划的计算分成两个子问题；依据子问题和子计划最优解的性质，设计了求解子问题和重新集结松弛约束的多项式算法；在此基础上提出了一个复杂性为O(T^4)的求解整个规划问题的多项式动态规划算法，这里T是规划时段上的周期数。

According to each joint motion parameter, the manipulators position and pose can be solved, as well as according to the specified relevant position and pose parameter, each joint motion parameter can be solved.

根据各关节的运动参数，求解机械手的位置和姿态；以及根据给定的相关位置和姿态参数，求解各关节的运动参数。

Based on the special decomposition of Hankel matrix, we can transform the problem of approximating a given matrix with a positive semidefinite real Hankel matrix of lower rank to a smooth unconstrained optimization problem.

对矩阵的低秩Hankel半正定矩阵逼近，采用特殊的分解形式，可将其转化为一个无约束的优化问题进行求解，本文应用拟牛顿方法求解无约束优化问题。

The other is the power series expansion method developed in this paper.

应用这种方法，可以避免常用的pagano方法求解动态问题所遇到的困难，使求解变得简便，适用范围更广。

The problem solving and inference functions will be provided by the hardware inference mechanism,the control mechanism,parallel processing,the logic programs developed on these machines and the software system for high-order predicate calculus.

FGCS的功能可分成3类：问题的求解和推理功能、基于知识的管理功能和智能接口功能问题的求解和推理功能将由硬件推理机制、控制机制、并行处理，以及在这些机制上开发的逻辑编程及高阶谓词演算软件系统提供。

In order to evaluate the PREE (Population, Resource, Environment, and Economy) development environment of Yinchuan city, based on the statistics data from Yinchuan Yearbook and the situation of "the eleventh five-year plan" of Yinchuan, choosing different multi-goal preferential factors, the paper established the PREE harmonious development nonlinear multi-goal planning model of Yinchuan city. In this paper, the pattern search method was used to solve PREE nonlinear multi-goal programming, the algorithm and the accomplishment of the Matlab procedure was given.

为评价银川市的经济、人口、资源和环境，根据《银川市统计年鉴》中的数据及银川市"十一五"规划情况，选取不同的多目标优先因子，建立了银川市人口、资源、环境和经济协调发展的非线性多目标模型，介绍了模式搜索法在求解银川市PREE非线性多目标模型的实际应用，给出了求解银川市PREE模型的算法和Matlab程序的具体实现。

By Monte Carlo simulation of stochastic demand, the hybrid simulation-optimization policy is brought forward to solve the model as well as the principle to select size of the sample. Benders decomposition algorithm and its accelerated technique are presented to solve the deterministic equivalent of primal problem.

利用随机需求的蒙特卡洛仿真，提出仿真一优化相结合的模型求解策略以及样本容量的选择法则，针对原问题的等价确定性问题设计Benders分解算法及其改进技术求解。

In this paper, pressure is used for a primary dependent variable and SIMPLE algorithm is used to simulate the 3-dimensional turbulent flow. In order to advance SIMPLE algorithm to compressible flow, retarded density is utilized.

本文采用SIMPLE方法，以压力为基本求解变量对三维可压缩湍流流场进行数值求解，并采用密度延迟修正将SIMPLE算法扩展到可压缩流动的计算。

A general super memory gradient projection method was generalized to solve the nonlinear programming problems about the nonlinear equality constraints and in equality constraints by using general projection matrix.

利用广义投影技术，将求解无约束规划的超记忆梯度算法推广，建立了求解带非线性等式和不等式约束优化问题的一种超记忆梯度广义投影算法，并证明了算法的收敛性。

But we don't care about Battlegrounds.

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

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

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