优化问题
- 与 优化问题 相关的网络例句 [注:此内容来源于网络,仅供参考]
-
Moreover, if the optimization problem has certain special feature, the simpler relaxation methods can be provided. For example, considering a generalized geometric programming problem, relevant relaxation linear programming can be obtained using its special structure. Based on the branch and bound method, a linear relaxation algorithm of global optimization is presented for generalized geometric programming, and the convergence of the algorithm is also proven.
此外,当优化问题具有某种特殊性质时,我们能给出更加简便的松弛化方法,如考虑广义几何规划问题,能充分利用其特殊结构,建立了广义几何规划问题的松弛线性规划问题;在分枝定界技术的基础上,提出了一个求广义几何规划全局解的线性松弛算法;证明了算法的收敛性。
-
The first model is the optimization problems with s linear objective function subject to a system of fuzzy relation equations and a system of fuzzy relation inequalities, which are solved by using path method and 0-1 integer programming with branch and bound method.
第一种为约束为模糊关系方程和模糊关系不等式的具有线性目标函数的优化问题,采用路径法及0-1整数规划中的分枝定界法对其求解;第二种为约束为模糊关系方程和模糊关系不等式的格线性规划问题,采用直接法、路径法及0-1整数规划法对其求解;第三种为模糊关系不等式为模糊的,即约束中有一个可接受的容差,采用容差法及正负理想法对其求解;第四种是一种新的可能性模糊线性规划问题,采用模糊数大小比较法、"切片-粘贴"法及正负理想法,并设计了随机模拟的遗传算法对其求解;第五种为期望值模型,利用期望值将其转化为清晰约束系数的线性规划问题的方法。
-
QoS multicast routing problem is a nonlinear combinatorial optimization problem,which has been proved that the problem is NP-complete problems.
QoS组播路由问题是一个非线性的组合优化问题,已证明了该问题是NP完全问题。
-
It transforms the primal problem into an ordinary optimization problem with an explicit dual function and simple constraints, with smaller size than primal constraints. It is convenient for engineering application.
该方法不仅给出了原问题显式形式的对偶函数,而且对偶变量的数目仅等于原问题部分约束的个数,原来的线性0-1规划问题被转化为只有简单约束的普通优化问题,极大地方便了工程应用。
-
The problem of finite precision multiuser decorrelator is formulated as linear bounded integer optimization problem,and the problem is shown to be NP-hard problem.
该文首先分析了应用有限精度序列为解相关矩阵序列的解相关接收机,将有限精度解相关的多用户检测问题归约为线性约束整数优化问题,同时证明此问题为NP-hard问题。
-
Among these problems,a CVRP problem is identified and formulated as the key optimization in designing this milk run system,and it is solved through an optimization process.
最后将问题归结为CVRP优化问题,建立了问题的模型,讨论了它的解法,并给出了问题的求解结果。
-
In the algorithm, radial-basis function neural network was utilized as forward model, and genetic algorithm was used to solve the optimization problem in the inverse problem, which can avoid the local minimum solution possibly encountered in the iterative inverse algorithm based on gradient descent and consequently achieve the global optimized solution of the inverse problem.
在该算法中,径向基函数神经网络用作前向模型,遗传算法用于求解逆问题中的优化问题,其优点是能够避免基于梯度下降法的迭代逆算法中可能遇到的局部最小问题,并能得到逆问题的全局最优解。
-
Parts of current parallel databases support expanding of data types, but all of them lack of theoretical foundation. It is difficult to predicate the performances of parallel query, complicated to optimize parallel query and unattainable to keep the correctness of parallel query optimization This thesis, for the first time, combines monoid algebra system with BSP parallel model systematically, and provides a general-purpose parallel object-relational database systems-PORDBMS.
文章系统地研究了资源分配问题的分解协调理论与方法,给出了非线性分解式模型的构造和有效的求解方法,其中对主问题提出了适应性较强的修正算法,可用于一些难于公式化的问题的模型构造与求解,逐步寻优策略可有效地求解非线性关联约束优化问题。
-
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法用于求解广义非线性互补问题中,在适当的条件下,该算法同样具有全局收敛性。
-
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难的组合优化问题,很多实际问题都可以抽象为对无向图上最大团问题的求解,所以,对最大团问题的研究无论在理论上还是实际上都有重要意义。
- 推荐网络例句
-
James, son of Zebedee, and John the brother of James, whom he named Boanerges, that is, sons of thunder
载伯德的儿子雅各伯和雅各伯的弟弟若望,并为他们起名叫"波纳尔革",就是"雷霆之子"
-
The southern Hungarian university city of Szeged will host part of the project, amounting to 40 percent of the total investment, which will mostly be paid for through Hungary's EU structural funds.
位于塞格德南部的匈牙利大学将负责部分项目,总计占总投入资金的40%。大部分资金将由匈牙利的欧盟结构基金会支付。
-
If you want a parrot as a pet, make sure it has been hatched in Britain.
如果你想要一只鹦鹉作为宠物,要确保是在英国孵出的。