الفهرس 
THE LINEAR PROGRAMMING CONCEPTOnly 14 pages are availabe for public view
 |  | from | 96 |  |  |
| | | from | 96 | | |
Abstract
The work deals with the solution of the linear programming problem by using the simplex method and the revised simplex method as well as simplex method with multiplicators. The cutting problem in one-dimension is explained. wo methods for solving this problem, with identical standard parent patterns are explained. The solution of the cutting problem In one-dimension with different standard parent patterns is also investigated, U s e is made of Bayoumi and Romanousky’s method ,which depends on the simplex method with multiplicators.