| 寻找对偶可行解的人工约束法 |
| |
| 引用本文： | 李文琦. 寻找对偶可行解的人工约束法[J]. 天津城市建设学院学报, 1995, 1(4): 25-29 |
| |
| 作者姓名： | 李文琦 |
| |
| 作者单位： | 天津城市建设学院数学教研室 |
| |
| 摘 要： | 文献[1]给出寻找对偶可行解的人工约束法，但只给出方法和结论，且可能情形的分类也不准确，所作的相应命题均可能是不正确的．笔者对可能情形给出三者必居其一且仅居其一的分类，对每种情形给出相应的命题及其证明，此外还给出人工约束条件中M的下界。
|
| 关 键 词： | 可行解 下界 对偶 约束条件 正确 证明 命题 结论 文献 准确 |
THE ARTIFICIAL CONSTRAINT METHOD FOR FINDING AN INITIAL DUAL FEASIBLE SOLUTION |
| |
| Li Wenqi. THE ARTIFICIAL CONSTRAINT METHOD FOR FINDING AN INITIAL DUAL FEASIBLE SOLUTION[J]. Journal of Tianjin Institute of Urban Construction, 1995, 1(4): 25-29 |
| |
| Authors: | Li Wenqi |
| |
| Affiliation: | Teaching and Research Section of Mathmatics |
| |
| Abstract: | in the literatured [1](pp. 260-6),the artificial constraint method for finding an initial dual feasible solution was given. But the literatured ionly showed the method and tile conclusion, the classification of the possible cases is not exact, and the corresponding propositions made may not be true. In this paper the author presents an exact classification of the possible cas cases, and in each case, the corresponding proposition is given with proof. Besides, The lower bound of M in the artificial constraint conditions is inferred. |
| |
| Keywords: | linear programming artificial constraint method. feasible solution dual simplex ethod Kuhn-Tucker optinlality conditions |
| 本文献已被 CNKI 维普 等数据库收录！ |
