optimization problem的例句大全

A multiobjective optimization problem involving n set functions is considered. Optimality conditions and duality results are obtained under generalized convexity conditions.

研究了n集函数的多目标优化问题，在广义凸条件意义下，获得了n集函数优化问题的最优性条件和对偶结果。

互联网摘选

The variable type of optimization design and the solution for computing optimization problem are defined, basic phrases for optimization design of complex system is clarified to instruct the design process.

定义了优化设计问题的变量类型以及解决设计问题的迭代方式；分析了复杂工程系统优化设计的基本阶段。

互联网摘选

Using of the augmented matrix transformation the fault detection filter model with the long time-delay to the same as the one the short time-delay. The solvable condition of the H ∞ filtering optimization problem and further the solutions are derived by linear matrix inequalities.

利用增广矩阵把长延时的故障检测滤波器模型转换与短延时的故障检测一样的数值结构形式，利用线性矩阵不等式方法，给出H∞滤波器的最优解的存在和求解方法，实现对故障的检测。

互联网摘选

To resolve resource scheduling problem efficiently in manufacturing grid, a multi-objective optimization mathematical model was put forward, which was based on task time, machining quality, cost and service quality.

摘要为有效地解决制造网格中的资源调度问题，提出了以任务流程时间、加工质量、流程成本和服务质量为目标的多目标优化数学模型。

provided by jukuu

A study on optimization problem and solving method of PCB assembly time of single mounter.

研究了单机PCB板组装时间优化问题及其求解方法。

互联网摘选

With the help of the capabilities of heuristic search and constraint handling, which the cooperative co-evolutionary algorithms have, the new CCRM algorithms will deal with the problem of high-dimension combined configuration space and timing and spatial optimization that come with the multi-robot cooperation.

这种方法充分利用了协进化算法在优化搜索方面的启发功能和遗传算法对约束条件的处理方法，解决了高维组合C空间的优化搜索问题、静态和动态约束问题和运动轨迹的时间优化问题。

互联网摘选

In this paper, the robust control problem of a hydrogenated cotton oil batch reactor with time optimization has been studied by the normal robust control method presented by Davison.

应用Davison提出的一般鲁棒控制方法讨论了具有时间优化的棉子油氢化间歇反应器的鲁棒控制同题。

互联网摘选

Vehicle routing problem with time windows ( VRPTW) is an NP-complete optimization problem.

带时间窗口的车辆路径问题（VRPTW）是一个NP-Complete优化问题。

互联网摘选

Solution of Order Picking Optimization Problem Based on Improved Ant Colony Algorithm

基于改进蚁群算法拣选作业优化问题的求解

互联网摘选

An approach of a genetic algorithm combined with Hopfield neural networks ( HP NNs) is adopted to resolve the order-picking optimization problem in the automated warehouse.

采用一种结合Hopfield网络模型的遗传算法，解决了自动化立体仓库中固定货架拣选作业路径优化问题。

互联网摘选

As the test scheduling problem has been verified to be NP problem, this dissertation adopts a new optimization algorithm based on probability density distribution called cross-entropy method for test scheduling.

由于测试调度问题已被证明属于NP完全问题，本文采用一种新的基于概率密度分布的优化算法&交叉熵方法，对其进行求解。

互联网摘选

First an event-driven stochastic switching model is introduced for power-managed systems. Under this model, the problem of dynamic power management is formulated as a constrained policy optimization problem.

通过建立动态电源管理系统的随机切换模型，将动态电源管理问题转化为带约束的策略优化问题，并给出一种基于矢量合成的策略梯度优化算法。

互联网摘选

The paper formulates this optimization problem as a Markov decision process ( MDP) and use dynamic programming techniques to obtain the solution.

本文把这样一个优化问题构造为马尔可夫决策过程，并提出了用动态规划解决该问题的方法。

互联网摘选

Owing to the high computational complexity, it is quite difficult to solve hybrid flow shop scheduling problem exactly. Heuristic algorithms and intelligent optimization algorithms ( e.g.genetic algorithm) have been proved to be effective and practical to achieve near optimal solution of this problem.

由于高度的计算复杂性（NP-hard问题），混合流水车间调度问题很难求得最优解，启发式算法和智能优化算法（如遗传算法）求解此类问题的近优解的有效性和实用性已被证实。

互联网摘选

Gene Algorithm is an intelligent optimization algorithm, which solves complex combination and optimization problem by simulating the process of natural anagenesis and using simple code and gene operation.

遗传算法是一种新的智能优化算法，通过模拟自然进化过程，利用简单的编码技术和遗传操作高效地解决复杂的组合优化问题。

互联网摘选

RATIONAL UNIVARIATE REPRESENTATION AND ITS APPLICATION IN OPTIMIZATION PROBLEM The Discuss of Dialgage'show Value Tropesis and Resolve Way

有理单变元表示在优化问题上的应用百分表的示值变动性与相关问题探讨

互联网摘选

However, CARI scheme requires an exhaustive search to solve a difficult combinatorial optimization problem whose complexity grows exponentially with the number of subblocks.

但是，CARI方法需要进行穷尽搜索以解决组合最优化问题，致使其复杂度随子块数的增加呈指数增长。

互联网摘选

The crucial point is to reformulate online optimization problem corresponding to nominal model with an appropriate additional robust and feasible constraint.

其关键在于为针对标称系统设计的在线优化问题附加适当的额外的鲁棒可行约束。

互联网摘选

Then, the discrete optimization problem is reformulated as continuous models and solved, with application to problems in engineering.

此外，本章给出了离散变量优化问题的连续化求解方法，并应用到工程中的实际问题。

互联网摘选

The optimization problem of UEP could be reformulated as a knapsack problem with additional constraints.

UEP的优化问题可以重新建模为带额外约束的多选择背包问题。

互联网摘选