According to the raised analysis theory and the simplex method principle, proposed an assignment problem linear programming solution.
根据凸分析理论和单纯形法原理，提出了指派问题的一个线性规划解法。
An optimal solution would require linear programming techniques with much less trivial code.
最佳解决方案需要线性编程技术，而且所需的代码更少。
This paper discusses how to found its optimal model through the analysis of model check countermeasure and proposes its solution based on linear and non-linear programming.
通过对模型校验策略的分析，讨论了如何建立这一问题的优化模型，并给出了基于线性规划和非线性规划的模型求解方法。
应用推荐