问题求解

Within this context, four specific areas are addressed:(1) By means of finite integration technique, a new kind of the first order partial difference equation is derived from the original disperse transmission line equation of the uniform waveguide's. As it is the kind of one dimension Dirichlet's boundary problem, it is convenient for us to solve this equation from the leapfrog scheme. Because computation is carried out in one dimension, both high calculation efficiency and precision have been obtained in this method. Meanwhile, this method provide us a different selection to simulate the transient response of waveguide with non-simplical, for examples cylinder and elliptic waveguide, and avoid solving the second order equation, or using finite difference time domain to simulate a three dimension problem, sometimes the latter precision is not satisfied with the need, or low efficiency.

在这一研究内容下，主要研究四个方面的问题：(1)在完成金属波导传输线方程时域形式的基础之上，应用有限积分技术，把波导特征模式的色散传输线方程，化简为一组新的一阶偏微分方程组，该边值问题属一维Dirichlet边值问题，从而便于用蛙跳格式求解，由于是在一维中计算，该方法具有很高计算效率和精度，从而避免了以往为得到金属波导中特征模的时域响应特性，须要求解二阶方程，或用时域有限差分方法求解三维问题的方法，对于后者来说，计算有时是不准确的，或是很耗时的例如计算诸如圆波导、椭圆波导等其它复杂形状的波导。

Notice that the solvng ELP problem is equivalent to determine a nonlinear mapping,using the nature that BP neural networks has the parallelism and the capabilities of intrinsic nonlinear mapping,we propose a methods of using back error propagation of ne...

而求解线性规划问题的许多有效方法如单纯形法，Karmarkar's方法等却无法直接用于推广的线性规划问题的求解，注意到推广的线性规划问题等价于一个非线性映射，利用BP神经网络的本质并行性和高度非线性处理能力，该文提出了一类求解推广的线性规划问题的BP神经网络方法，它具有网络构建简单，求解精度高，计算量小等优点，实验结果表明其高效性。

For a class of bilevel multi-objective decision,this paper converts it into the problem of equivalent single-level multi-objective decision,then makes use of the inversion property of the genetic algorithm with the ergodic property of the chaos optimization method.

针对求解一类二层多目标决策问题，首先将其转化为等价的单目标决策问题，然后利用遗传算法优化的反演性和混沌优化方法的遍历性，并结合精确不可微罚函数求解非线性约束优化问题，提出了求解此类问题的混沌遗传算法。

For a class of bilevel multi-objective decision,this paper converts it into the problem of equivalent single-level multi-objective decision,then makes use of the inversion property of the genetic algorithm with the ergodic property of the chaos optimization method.Combined with exact non-differentiable penalty function,a new chaos genetic optimization algorithm is presented.

针对求解一类二层多目标决策问题，首先将其转化为等价的单目标决策问题，然后利用遗传算法优化的反演性和混沌优化方法的遍历性，并结合精确不可微罚函数求解非线性约束优化问题，提出了求解此类问题的混沌遗传算法。

A class of bilevel multi-objective programming was converted into the problem of equivalent single-level multi-objective programming. Then a new chaos genetic optimization algorithm was presented by using the inversion property of genetic algorithm and the ergodic property of chaos optimization method and combining with the exact l_1 penalty function.

针对求解一类二层多目标规划问题，首先将其转化为等价的单目标规划问题，然后利用遗传算法优化的反演性和混沌优化方法的遍历性，并结合精确罚函数求解非线性约束优化问题，提出了求解此类问题的混沌遗传算法。

The paper analyses material transportation problem and give the solvable methods; analyses delivery vehicle route problem, and then construct its corresponding mathematical model and present a heuristic algorithm based on C—W algorithm; analyses the optimum scheduling problem of trucks, and then construct its corresponding mathematical model and put forward a new algorithm; analyses the Postal Transportation Problem which will perhaps be used in supply chain of manufacturing system, and then construct its corresponding mathematical model and present an approximation algorithm.

分析了制造系统供应链中供需平衡、供需不平衡、有转运等各种情况下的物资调运问题，给出了求解方法；分析了制造系统供应链配送作业中的配送车辆路线问题，建立了相应的数学模型，提出了一种基于C-W算法的启发式算法，该算法较好地解决了有时间约束的配送问题；分析了制造系统供应链中的货运卡车优化调度问题，建立了相应的数学模型，提出了一种基于表上作业法的求解算法；分析了制造系统供应链中有潜在利用价值的邮政运输方式问题，在详细描述了该问题的基础上，建立了相应的数学模型，提出了一种近似求解算法，该算法较好地解决了邮政运输方式这样的多种物流、多种运输方式，有严格时限和众多外部约束的特大型、复杂、并行的交连系统的计划调度问题。

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.

文章系统地研究了资源分配问题的分解协调理论与方法，给出了非线性分解式模型的构造和有效的求解方法，其中对主问题提出了适应性较强的修正算法，可用于一些难于公式化的问题的模型构造与求解，逐步寻优策略可有效地求解非线性关联约束优化问题。

This paper deals with the partial capacitance calculation of the high voltage transmission line for the neutral beam injectors.

该文研究了中性束注入系统中高压传输线部分电容的求解问题；根据传输线多层同轴导电壳的结构特点，利用多重镜像法确定与平行导线相应的一系列的镜像线电荷，求解的问题变为由一系列平行线电荷构成的电场问题，传输线的部分电容则通过各导体间的电位系数来求得；这一方法避免了直接求解的困难以及大量数值计算等问题。

It is pos ible to solve some particular types of integral linear programming problems by virtue of LCS-orientated algorithm or microprocessor.

本文用字编码函数的方法，得到求解LCS的数值模型，证明可用求解Tomograph问题的算法和硬件求解LCS问题，以及可以用LCS的算法和硬件求解某种类型的整数规划问题。

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法用于求解广义非线性互补问题中，在适当的条件下，该算法同样具有全局收敛性。

Plunder melds and run with this jewel!

掠夺melds和运行与此宝石！

My dream is to be a crazy growing tree and extend at the edge between the city and the forest.

此刻，也许正是在通往天国的路上，我体验着这白色的晕旋。