computer package programs for mathematical programming techniques to solve linear programming models
In developing the simplex algorithm, G. Daunting made use of the classical Gauss-Jordan elimination method which is families to anyone solved a system of linear equations. 'The key idealistic a multiple of one equation and add it to or subtraction another equation in order to eliminate one of t...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Other |
| 语言: | other |
| 出版: |
The Institute Of National Planning.
2018
|
| 主题: | |
| 在线阅读: | http://repository.inp.edu.eg/xmlui/handle/123456789/4099 |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|