01147nam a22002057a 4500003000400000005001700004008004100021040002400062082002700086100002400113245016200137246013200299260002700431300004400458490002900502520033800531650002400869650002300893650002500916INP20260622100529.0260505s1984    ua   ||fr|||| 00| 0 eng d  aEG-INPbengcEG-INP04a338.9    memo 1391221  aEl-Daoushy, Abdalla10aComputer package programs for mathematical techniques to solve linear programming models / (1391)c  Abdalla El-Daoushy; The Institute of National Planning.   aبرامج حزمة الحاسوب لتقنيات البرمجة الرياضية لحل نماذج البرمجة الخطية  aCairo : bINP, c1984.  a122 p. ؛ c27 cm.gincluded in volume.2 aExternal Notes ؛ v1391  aIn 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  2qmarkamathematics.  2qmarkaProgramming  2qmarka techniques,