| 用初等变换的方法求线性规划问题第一个可行基 |
| |
| 引用本文： | 唐晓静.用初等变换的方法求线性规划问题第一个可行基[J].安徽师范大学学报(自然科学版),1994,17(2):76-82. |
| |
| 作者姓名： | 唐晓静 |
| |
| 作者单位： | 安徽财贸学院 |
| |
| 摘 要： | 本文提出了一种用初等变换的方法，将线性规划问题化成简单形式后，再求出线性规划问题的第一个可行基或对偶可行基。以尽量避免引入人工变量，使问题大大简单化，并在理论上证明了这种方法的可行性。
|
| 关 键 词： | 可行基 线性规划 初等变换 |
For the Fifst Feasible Base of Linear Programming Problem by the Mehtod with Elementary OPeration |
| |
| Tang Xiaojing.For the Fifst Feasible Base of Linear Programming Problem by the Mehtod with Elementary OPeration[J].Journal of Anhui Normal University(Natural Science Edition),1994,17(2):76-82. |
| |
| Authors: | Tang Xiaojing |
| |
| Institution: | Anhui Finance and Trade College |
| |
| Abstract: | A method is presented,which uses elementary alternation,changing linear programming problem into simpler form,to find thd first feasible basis or dual feasible basis of the problem,As artificial variables are avoided as for as possible,the problem is made much simple,and the method is theoretically proved feasible. |
| |
| Keywords: | Feasible basis dual feasible basis slack variable optimun solution |
| 本文献已被 CNKI 维普 等数据库收录！ |
