查询词典 integer optimization

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++程序。

Similar to the reasoning of linear optimization non-linear model optimization problem Can be viewed as a mixed—integer programming problem.

对非线性模型，结合问题提出了基于改进遗传算法的优化方法。

This article outlines the integer aliquot concept in the first primary theory of numbers, the basic nature, as well as some special integer divisible characteristics.

本文先概述初等数论中整数的整除概念、基本性质，以及一些特殊整数的可除性特征。

Carries on the classification to the question, analyzes each kinds of questions the explanation mentality, inquires and summarizes that it can 100 within the odd number aliquot aliquot characteristic, finally discovered that any integer can by the lowliest place digit be 1,3,7,9 aliquot integer characteristics according to the lowliest place numeric classification, each kind has certain rule.

对问题进行分类，分析各类问题的解答思路，探寻、总结出能被100以内奇数整除的整除特征，结果发现任何一个整数能被末位数字是1，3，7，9整除的整数特征可按末位数字分类，每一类都有一定的规律。

Finally, we obtain the solutions of the 0-1 Integer Programming problem. The most merit of the model is its automatization characteristic, and the model fits to solve arbitrary 0-1 Integer Programming problem having arbitrary variable element.

该模型的最大优点在于具有自动化的特点；同时，从理论上来讲，该模型适合含有任意变量的任意0-1整数规划问题的求解。

We studied the asymptotic properties of the integer part of the k-th root positive integer and gave an interesting asymptotic formula.

研究了一个关于正整数κ次根的整数部分序列的均值，并利用初等的方法得到了一个有趣的渐近公式： 3。

A verifier can be convinced that the committed number x is neither less than the integer a nor more than the integer baiter the protocol is operated only once, and hence the exact proof that x lies in the interval is achieved.

为了去掉这种方法上的重复性，通过联合运用两承诺值相等协议及CFT证明协议提出了一个证明承诺值位于特定区间的新协议，协议运行一次便可使验证者确信承诺值x位于区间中。

In the problem, there are m persons who are to be assigned to do n jobs, and the number of the persons who are assigned to do the jth job is bj, where bj is an unknown positive integer number to be calculated such that djbjej, dj and ej are known positive integer number (j=1,2,…,n) such that ∑nj=1bj=m and m≥n.

考虑一类较一般的最优指派问题：欲指派m个人做n项工作，要求每个人只做一项工作，第j项工作可以由bj个人共同去做，其中bj是待求未知数，满足dj≤bj≤ej(即ej，dj为第j项工作所需人数的上下限)及∑nj=1bj=m，dj，ej为已知常数，j=1，…，n。

Finally it offers the analysis of the fault-tolerance system as well as its test verification.

这样，运行于空间环境中的系统的设计目标就是在保证系统实时性

However, it is still difficult to find out the real reason of the increase of the keratinized gingiva during the orthodontic extrusion whether it is due to the proliferation of the gingival tissue or to its elastic nature, that is because the proliferation of the fibroblasts as well as the connective tissue changes in volume and the intra-fibers spaces were all immeasurable in most of the studies.

然而，仍然难以找到真正的原因增加的角化牙龈在正畸挤压它是否是由于扩散的牙龈组织或其弹性性质，这是因为增殖的成纤维细胞以及作为结缔组织的变化量和内部纤维空格都是不可估量的，大多数的研究。