Linear planning: it's the issue for computing the minimum or maximum value of linear function under the linearconstraint.
线形规划：求线性函数在线性约束下达最值的问题。
2
The first is the full information maximum likelihood method with linearconstraint of coefficient matrixes in structure equation.
结构方程系数矩阵线性约束下的完全信息极大似然估计法。
3
Discrete repair operator is presented on the basis of the theory of gradient to improve the performance of the algorithm in solving non-linearconstraint.