线形规划是一种应用广泛的解优化问题的模型，一般使用单纯形法求解。单纯形法的理论和计算方法都比较繁琐，我们在这里只介绍其基本概念。
线形规划：求线性函数在线性约束下达最值的问题。
Linear planning: it's the issue for computing the minimum or maximum value of linear function under the linear constraint.
基于解非线形规划的凸单纯形法，对一类线形分式规划的消耗系数矩阵进行灵敏度分析。
Based on the convex simplex method for nonlinear programming, a sensitivity analysis of consumption coefficient matrix in linear fractional programming is presented.
在进度计划的优化方法方面，仅以“工期-成本优化”为例，用线形规划方法建立了求解模型。
As to optimization of the network technique, make emphasis on "time-cost optimization" and set up mathematic model using Linear Scheduling method.
应用推荐