查询词典 integer optimization

In the more mature areas such as linear programming and unconstrained optimization, and in those of intermediate maturity such as integer and constrained convex optimization, emphasis will be placed on rapid, large-scale computation.

在那些更为成熟的如线性规划和无约束优化等领域和一些不太成熟的如整数和约束优化等领域，研究的重点将被放到快速的，大规模的计算上。

Firstly, according to the difficulties in the optimization of chemical engineering and the intrinsic disadvantage of deterministic optimization algorithms, this work analyzed the importance and advantage of stochastic algorithms, and proposed some important aspects in research on them. Secondly, genetic algorithm was applied to two problems of data driven modeling, one of which was combination problem, the other was mixed integer nonlinear programming. Thirdly, systemic investigations were made on the basic structure, dynamic behavior and modifications of particle swarm optimization. Lastly, two kinds of proposed PSO algorithms were applied on calculation of phase equilibrium, which is nonconvex optimization.

本文首先根据化工优化中存在的困难和确定性优化算法内在的缺点，分析了随机优化算法的重要性，并提出研究随机优化算法应注意的问题；其次，将遗传算法应用于两个数据驱动建模问题，一为组合优化问题，一为混合整数优化问题；再次，从粒子群优化算法的基本结构、运动行为、改进方法做了系统的研究：最后，将提出的两种改进粒子群优化算法应用于相平衡计算问题，为非凸全局优化问题。

In this paper a production process flow chart of discrete manufacturing is presented by means of petri net, the optimization model of workload-stock is established. An approach of the optimal workloads is provided using analysis integer programming and integer matrices.

本文以Petri网作出一个离散制造中的生产过程流程网，建立起工作量与库存的优化模型，以整数规划与整数矩阵等分析算法给出一个在生产中制定最优工作量规划的方法。

In this algorithm, at first the reactive power optimization problem is converted to integer nonlinear programming problem with discrete control variables which are solved by IGA; then by use of PDIP algorithm, the continuous variables which can match with the obtained most are solved, and the reactive power optimization is changed into a nonlinear programming problem with continuous control variables.

首先通过改进遗传算法求解无功优化问题中的离散变量，然后采用原对偶内点法求解与已获得离散变量最匹配的连续变量。

Introduce optimization modeling and solution techniques including linear, non-linear, integer, and network optimization, and heuristic methods

介绍最优化模型与求解的技巧（包含线性、非线性、整数、网络最优化与启发式算法

An integer coded hybrid particle swarm optimization algorithm which incorporates the crossover and mutation operators of Genetic Algorithm with basic particle swarm optimization is proposed to solve the model, and a C ++ code is programmed.

同时提出基本粒子群优化算法与遗传算法交叉、变异算子相结合的整数编码的混合粒子群优化算法来求解该选址模型，并编制了相应的C++程序。

During the investigation, the optimization of infinitesimal information granularity is first solved to determine the low bound of the minimal power, and then the optimization of integer bit is solved, resulting in a fast integer bit-loading algorithm.

首先对无限小信息粒度的最优化问题进行分析，确定最小功率的下界。在此基础上再对整数比特的最优化问题进行求解，由此得到了一种快速的整数比特加载算法。

On global optimal algorithms, a heuristic 0-1 Integer Liner Programming algorithm is achieved, which combines heuristic enumeration method and revised simplex method. Simulation experiments show that the degree and optimization efficiency in our algorithm is obviously improved compared with the MATLAB 7 bintprog function that is a 0-1 integer programming algorithm. Moreover our algorithm isn\'t relevant to the scale changes of Web services composition and candidate service sets, thus it is applicable for the scenes that the scales of Web services composition changed dynamically. But for Web services composition with service alliance, the algorithm is unable because the non-linear global optimal model of the fitness function and QoS constraints can\'t be expressed in linear mode.

在全局优化算法研究上，基于启发式0-1整线性规划算法结合了修正单纯形法和启发式枚举法，仿真实验表明该算法与MATLAB 7的0-1整数规划方法比较，在优化程度及优化效率上得到了显著改进，并且对服务组合和候选服务集合的规模变化没有明显的相关性，因而该算法可用于服务组合规模动态变化的场景，但该算法不能应用于存在服务联盟的非线性全局优化模型。

The topics covered in this course include: unconstrained optimization methods, constrained optimization methods, convex analysis, Lagrangian relaxation, nondifferentiable optimization, and applications in integer programming.

这门课程的主题包括：无约束最优化方法，约束最优化方法，凸分析，拉格朗日松弛法，不可微函数最优化，以及在整数规划上的应用。

The topics covered in this course include: unconstrained optimization methods, constrained optimization methods, convex analysis, Lagrangian relaxation, nondifferentiable optimization, and applications in integer programming.

这门课程的主题包括：无限制最适化方法，限制最适化方法，凸分析，拉格朗日松弛法，不可微分函数最适化，以及在整数规划上的应用。

Finally, according to market conditions and market products this article paper analyzes the trends in the development of camera technology, and designs a color night vision camera.

最后根据市场情况和市面上产品的情况分析了摄像机技术的发展趋势，并设计了一款彩色夜视摄像机。

Only person height weeds and the fierce looks stone idles were there.

只有半人深的荒草和龇牙咧嘴的神像。