## 浅谈线性规划中的检验数

其中符号 表示商品 的价值;变量 表示 的对第 种资源的消耗量; 为对应的第 种资源的上限约束.

Vertex Labelings on Graphs
Abstract: Linear programming is an important part of operations research, based on linear programming theory can effectively guide people's daily production management, has been widely used in various fields of production and life of people. Given a resource limited production tasks, there are   resource constraints and   kinds of products. The values of commodities is different. The goal of the production tasks for a maximum total value of production. Thus, the mathematical expression of the linear programming problem as follows:
Where the symbol   represents the value of goods; variable   represents the resources consumption of the  th kind commodity; variable  represents the upper limit of the  th kind of resources.

A linear programming problem can be simply defined as a linear constraint solving linear objective function maximum or minimum problems solving and decision for the optimal solution, the key is to test the number, so this article focuses on the number of tests carried out learning the study. Inspection can take advantage of the dual problem of the number makes more simple and easy. In this paper, the definition of two different forms of the number of tests were analyzed, and the number of tests based on the dual problem solving were analyzed.
Key words: LP; dual problem; simplex algorithm; test number; optimal solution

1.线性规划及其对偶问题    4
1.1线性规划    4
1.2线性规划问题数学模型    4
1.3线性规划对偶问题    6
2.线性规划中的检验数    7
2.1两种形式的检验数    7
2.2检验数与最优解问题    9
2.3检验数与对偶问题    12
3.结束语    16

------分隔线----------------------------