(1391) 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:
| Main Author: | |
|---|---|
| Format: | Other |
| Language: | other |
| Published: |
The Institute Of National Planning.
2018
|
| Subjects: | |
| Online Access: | http://repository.inp.edu.eg/handle/123456789/4099 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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 the unknowns from the second evacuation. |
|---|