| 线性规划问题的基元素可交换性分析 |
| |
| 引用本文： | 牛俊友.线性规划问题的基元素可交换性分析[J].吉林工学院学报,1988(1). |
| |
| 作者姓名： | 牛俊友 |
| |
| 作者单位： | 吉林工学院管理工程系 |
| |
| 摘 要： | 本文讨论了线性规划问题基元素的可交换性,从理论上阐述了具有n个规划变量,m个约束条件的标准形式的线性规划问题,它的基本可行解的个数不超过从n个向量中每次取出m个不同向量的组合数.从而为线性规划问题的单纯形解法提供了理论依据.
|
| 关 键 词： | 线性规划 基本解 基元素 基变量 基本可行解 最优解 |
Analysis of the Exchangeability of the Basic Elements in Linear Programming Problems |
| |
| Niu Junyou The Management Engineering.Analysis of the Exchangeability of the Basic Elements in Linear Programming Problems[J].Journal of Jilin Institute of Technology,1988(1). |
| |
| Authors: | Niu Junyou The Management Engineering |
| |
| Institution: | Niu Junyou The Management Engineering Department |
| |
| Abstract: | This paper discusses the exchangeability of the basic elements in linear programming problems, and analyses theoretically the standard linear programming problems which include m constraints and n programme variables. It is found that the number of its basic feasible solutions is not more than the combinatorial number of the m different Vectors taken from n vectors. Thus the simplex method of the solution of the linear programming problems is provided with the theoretical basis. |
| |
| Keywords: | linear programming fundamental soutoins basic element basic variably basic feasible solutions optimized solutions |
| 本文献已被 CNKI 等数据库收录！ |
