The linear programming with interval number in target function and constraintcoefficient is analyzed thoroughly.
并对约束系数和目标函数系数为区间数的线性规划问题进行了深入的分析。
2
The first is the full information maximum likelihood method with linear constraint of coefficient matrixes in structure equation.
结构方程系数矩阵线性约束下的完全信息极大似然估计法。
3
The paper discuss the effect exerting on objective function, optimum solution and shadow price in LP when consumption coefficient matrix a change and a inequality constraint is increased or decreased.