查询词典 discrete programming

Discrete calculus , discrete probability distribution s, discrete Fourier transform s, discrete geometry , discrete logarithm s, discrete differential geometry , discrete exterior calculus , discrete Morse theory , difference equation s, and discrete dynamical system s.

在应用数学中，离散模型连续模型的离散近似。在离散模型中，离散方程are fit to 数据。使用递推关系是这种建模方式的一般方法。时标微积分是差分方程理论与微分方程理论的统一，应用在需要建立离散和连续同步数据模型的领域。

In this paper, based on the conjugate function and the dual programming of convex programming, with the dual cone, to conic programming, the dual programming is fully discussed, the expression of the dual programming is educed, the main dualities are proved, and the dualities of the familiar conic programming are studied.

以共轭函数和凸规划的对偶规划为基础，利用对偶锥的概念，全面讨论了一般锥规划的对偶问题，严格推导出锥规划对偶规划的表示形式，给出了锥规划的主要对偶性质，并用这些结果研究了常见锥规划的对偶性。

Thirdly, on the base of the existent error estimate of elliptical Galerkin projection operator, obtain semi-discrete and complete-discrete error estimates betwent EFG solution and exact solution of parabolic partial differential equation. Semi-discrete error estimate show that the rank of r is accordance with the approximation rank of subspace S_h. Complete-discrete error estimates show that it not only have relation with radius r of domain of influence, but also have relation with the step length of time variable and the way of discrete.Lastly, give typical examples and draw up procedures of MATLAB.

再次，在"椭圆Galerkin投影"算子的误差估计的基础上，对用EFG法解抛物型偏微分方程的EFG解与精确解之间作了半离散和全离散的误差估计，半离散的误差估计表明所给出的误差界限关于r的阶是与子空间S_h的逼近阶相一致的，全离散的误差估计表明所产生的误差不但与影响域半径r有关，而且与离散时间变量的步长τ及其离散方式有关。

Using the mathematical tool"DifferenceGeometry",it is possible to define the discrete geometric metrics such as discretefirst fundamental form,discrete second fundamental form,discrete unit mainnormal vector,discrete Gauss curvature,discrete mean curvature and discreteLaplacian.

首先，运用"差分几何"这一工具，可以构造离散第一、第二基本形式，离散单位主法向，离散高斯曲率，离散中曲率等离散几何量和离散Laplace算子。

This course offers an introduction to primary convex analysis, linear programming, non-linear programming, dynamic programming, multi-objective programming, multi-level programming, calculus of variations, and optimal control, which are the optimization methods commonly used in economics and finance.

课程内容简介：本课程介绍凸分析基础、线性规划、非线性规划、动态规划、多目标规划、多层规划、变分法、最优控制，这些都是西方经济学、金融学中常用的最优化方法。

The basic idea is to set a continuous solution of the region with a finite number of discrete points instead of a grid consisting of, these discrete points called grid nodes the solution of a continuous area on a given function of continuous variables used in the definition of discrete grid variable function approximation the original equation and boundary conditions in the micro-business operators to approximate differential, integral with the points and to approximate, so the original differential equations and boundary conditions are replaced by algebraic equations near Side, that is, finite difference equations , solve this equation group can get the original problem in discrete points on the approximate solution.

基本思想是把连续的定解区域用有限个离散点构成的网格来代替，这些离散点称作网格的节点；把连续定解区域上的连续变量的函数用在网格上定义的离散变量函数来近似；把原方程和定解条件中的微商用差商来近似，积分用积分和来近似，于是原微分方程和定解条件就近似地代之以代数方程组，即有限差分方程组，解此方程组就可以得到原问题在离散点上的近似解。

The underlying uniformity on a discrete metric space is the discrete uniformity, and the underlying topology on a discrete uniform space is the discrete topology.

在

The combinatorial and delimitative algorithm can be used to solve the problem. A software called "Power Discrete" to implement this algorithm is developed by using Microsoft Visual6.0. It is a useful tool for linear programming problem with discrete variables and for discrete optimum design of structures, and in addition, the software also includes other algorithms such as genetic algorithm.

在国际上， 20世纪 60年代末期和 70年代初期，研究人员已开始对工程离散变量优化设计问题进行研究，但由于当时对于连续变量的非线性规划问题的研究还不够深入，所以在 70年代和80年代，研究的重点集中于连续变量的非线性规划问题。

Three solution algorithms for classical transportation continuous/discrete/ mixed network design problems are designed based on particle swarm optimization approach, in which the continuous NDP is studied in detail, discrete and mixed NDP are only described the frameworks of the solution algorithms.2. Generally, road capacity constraints must be added to the lower level problem of classical discrete NDPs bilevel programming model in order to avoid traffic assignment on candidate roads.

本论文研究工作主要有如下几个方面：(1)基于粒子群优化思想设计了求解传统的城市道路交通网络设计问题的算法，其中详细研究了连续网络设计问题，并用两个网络例子进行了数值实验；并给出了离散网络设计问题和混合网络设计问题的求解算法思路和主要步骤。

In this paper,a quadratic programming method based on semidefinite programming is given to solve the design of FIR filters with discrete coefficients in the light of literature 6,which can give a better bound than a semidefinite programming relaxation method.Based on the model,the Branch-and-Bound algorithm is used to solve this problem.

基于离散系数滤波器设计问题已有的半定规划松弛模型，利用文献[6]的方法给出了该问题的二次规划松弛模型，该模型能给出比半定规划模型更好的界，然后运用分支定界方法求解该模型。

"Please accept this talisman as a token of our thanks."

请收下这个护身符以表达我们的感谢。

If I have that magic, I will be more acceptable in the society.

如果我拥有那种魔法，我将更加被这个社会所容纳。