查询词典 optimization problem

Delay constrained multicast problem is an important part of multipoint routing optimization problem and has been proved to be a NP-Complete problem.

有时延约束的组播问题是通信网络多点路由优化问题中的重要部分，已被证明是NP complete问题。

Ramsey number problem is a famous optimization problem, and is also a NP complete problem.

Ramsey数问题是一个著名的组合优化问题，同时也是一个NP完全问题。

The slab sequencing problem in hot strip production is a complex combination optimization problem.It can be formulated as Prize Collecting Traveling Salesman Problem.

热轧带钢生产中的板坯排序是一种复杂的组合优化问题，可以归结为一个PCTSP问题。

It is known that a production sequencing problem in mixed-model assembly line falls into NP-hard class of combinatorial optimization problem and thus a large-sized problem may be computationally intractable.

本文应用一种解大规模组合优化问题，特别是NP完全组合优化问题的有效近似算法——模拟退火算法，来求解混流生产线的投产排序问题，克服了上述缺点。

With the idea of smoothing Newton method, we propose a new class of smoothing Newton methods for the nonlinear complementarity problem based on a class of special functions. In this paper, complementarity problem is converted into a series of smoothing nonlinear equations and a modified smoothing Newton algorithm is used to solve the equations. We use Newton direction and Gradient direction together in the algorithm which guarantees that our method is globally convergent. Also using another smoothing function, we reformulate the generalized nonlinear complementarity problems defined on a polyhedral cone as a system of smoothing equations and a smooth unconstrained optimization problem. Theoretical results that relate the stationary points of the merit function to the solution of the generalized nonlinear complementarity problems are presented, we use the modified smoothing Newton algorithm in generalized nonlinear complementarity problems, under mild hypothesis, a global convergence is proved.

本文一方面基于现有的各种光滑Newton法的思想和半光滑理论，利用著名的F-B互补函数的光滑形式，首先将互补问题的求解转化为求解一系列光滑的非线性方程组，然后给出了一种修正的光滑Newton法，该方法不仅放宽对函数F的要求，在Newton方程不可解时引入初始效益函数的最速下降方向，而且光滑因子的选择也比较简单可行，同时在适当的条件下，证明了其算法具有全局收敛性；另一方面，借助另一种F-B光滑函数，将多面体锥上的广义互补问题转化为一种光滑形式，讨论了优化问题的稳定点与广义非线性互补问题的解之间的理论关系，并将这种修正的光滑Newton法用于求解广义非线性互补问题中，在适当的条件下，该算法同样具有全局收敛性。

By using the transfer matrix method of multibody system, the hard problem of computation of the vibration characteristics of LRMLRS coupled with rigid bodies and elastic bodies is solved which is very difficult to the ordinary dynamic methods, and the vibration characteristics of LRMLRS which is varied when the number of rockets in the launch device is varied, is obtained conveniently. By developing augmented eigenvectors of the LRMLRS and its orthogonality conditions, the nonorthogonality problem of the multibody system including rigid bodies and elastic bodies is solved and the exact analysis of the dynamics response of the LRMLRS including rigid bodies and elastic bodies is realized. By using the random integer programming method, the hard optimization problem which contains continuous variables, discrete variables and random variables at the same time is solved. This method provides a technology for optimum design with random variables and discrete variables. The dynamic optimum design is realized to decrease the number of rockets consumption in the LRMLRS test. The simulation system of dispersion of fire is established by using the maximum entropy method to estimate dispersion of fire.

通过应用多体系统传递矩阵法，解决了刚弹耦合远程多管火箭多体系统振动特性这一通常力学方法不便于解决的计算难题，方便地获得了远程多管火箭振动特性及其随发射架上火箭弹个数变化而变化的情况；通过构造增广特征矢量及其正交性条件，解决了刚弹耦合多体系统特征矢量不具有通常意义下的正交性的难题，实现了对刚弹耦合远程多管火箭动力响应的精确分析；应用随机整数规划法，解决了同时考虑连续、离散和随机变量等多种设计变量的优化设计难题，为含随机和离散变量的优化设计提供了手段，实现了减少远程多管火箭试验用弹量的动态优化设计；建立了应用最大熵法估计的密集度仿真系统，优化射序和射击间隔，实现了提高远程多管火箭射击密集度的动态优化。

By introducing a smooth merit function for linear inequalities system problem, the problem was equivalently reformulated as an unconstraint optimization problem.

通过引入线性不等式组问题的一类光滑价值函数，将其求解问题等价地转化为无约束优化问题的求解。

Maximum Clique problem is a classic NP hard combinatorial optimization problem, a lot of practical problems can be abstracted as undirected graph of the largest corporations to solve the problem, therefore, the largest corporation on the issue of research both in theory and in fact have a major significance.

最大团问题是一个经典的NP难的组合优化问题，很多实际问题都可以抽象为对无向图上最大团问题的求解，所以，对最大团问题的研究无论在理论上还是实际上都有重要意义。

The QoS multicast routing optimization problem was changed into a quasi-continuous problem by using a node series encoding method. Constrained terms in the problem were processed by the penalty function.

该算法采用一种节点序列编码方案，将路由优化问题转化成一种准连续优化问题，并采用罚函数处理约束条件。

The traveling agent problem is a complex combinatorial optimization problem.Ant colony algorithm suits to solve nondeterministic polynomial problem,as it is a new evolutionary algorithm,has the characteristics of parallelism,positive feedback and heuristic search.

旅行Agent问题是复杂的组合优化问题，蚁群算法作为一种新的生物进化算法，具有并行、正反馈和启发式搜索等特点，适合求解NP难问题。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。