运筹学基础教材Operations-research-foundation

说明：  行人群体疏散仿真的社会力模型，可用于做系统仿真(Social force model for pedestrian evacuation)

运用格子Boltzmann方法中的伪势模型，模拟胀大平面流道中的两相流动，左边幂律流，右边牛顿流体。得出流动过程中，各个瞬态的结果。(Using lattice Boltzmann method of pseudo potential model to simulate the swell plane channel flow, on the left side of the power-law fluid flow. On the right side of the Newtonian fluid. In the process of flowing, the result of each transient.)

说明：  重力异常正演代码，请好好使用它。帮助学习。。。。(Gravity anomaly forward code, please use it well. Help learn)

mimo系统中在高信噪比下，一个发射天线，两个接收天线的性能仿真。(mimo systems at high signal to noise ratio, a transmitting antenna, two receive antenna performance simulation.)

说明：  二维FDTD程序计算近场模型，包括建模文件以及电磁场递推文件，入射角度为0°。模型时一个介质方柱。(The two-dimensional FDTD program calculates near-field models, including modeling files and electromagnetic field recursion files, with an incident angle of 0. The model is a medium square column.)

说明：  在科学与工程计算中，经常遇到求解非线性方程组的问题；非线性方程组在收敛速度及收敛性比线性方程组要差，特别对于非凸的非线性方程组，其求解更是困难。下面简要介绍非线性方程组的三种解法——牛顿法、拟牛顿法、同伦算法，分析三种解法的适用性，并附Matlab原程序。(Scientific and engineering computing, often encounter the problem of solving nonlinear equations speed of convergence of nonlinear equations and linear equations worse than convergence, especially for non-convex nonlinear equations, which is even more difficult to solve . The following briefly describes three solutions to nonlinear equations- Newton method, quasi-Newton method, homotopy method, the applicability of the three solutions, along with Matlab original program.)

利用拉格朗日松弛法求解机组组合问题，考虑领域搜索的随机性(Using Lagrangian relaxation method to solve the unit combination problem, considering the randomness of the search field)

实现求取雅克比矩阵的程序，对于学习数值分析的同学会很有用(Realize the procedures for Jacques than matrix )

在计算流体力学中，多项流中有相变时，基于温度的相变UDF(Mass based on the temperature of the phase change in the UDF)

若矩阵A中的某一元素A[i，j]是第i行中的最小值，而又是第j列中的最大值，则称A[i，j]为矩阵A中的一个鞍点。请写出一个可确定此鞍点位置的算法（如果这个鞍点存在）。(If the matrix A, an element A [i, j] is the minimum value in the i-th row, but is the maximum value of the j-th column, then A [i, j] for the matrix A is a saddle point. Please write a algorithm to determine the position of saddle point (saddle point exists).)