| dc.contributor.author | el-daoushy, abdalla | |
| dc.date.accessioned | 2018-08-13T13:30:54Z | |
| dc.date.available | 2018-08-13T13:30:54Z | |
| dc.date.issued | 1984-01 | |
| dc.identifier.uri | http://repository.inp.edu.eg/xmlui/handle/123456789/4099 | |
| dc.description.abstract | 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. | en_US |
| dc.language.iso | other | en_US |
| dc.publisher | The Institute Of National Planning. | en_US |
| dc.relation.ispartofseries | External Notes.;1391 | |
| dc.subject | Programming. | en_US |
| dc.subject | techniques | en_US |
| dc.subject | mathematics. | en_US |
| dc.title | computer package programs for mathematical programming techniques to solve linear programming models | en_US |
| dc.type | Other | en_US |
