| Article ID: | iaor1989698 |
| Country: | India |
| Volume: | 10 |
| Issue: | 1 |
| Start Page Number: | 165 |
| End Page Number: | 176 |
| Publication Date: | Jan 1989 |
| Journal: | Journal of Information & Optimization Sciences |
| Authors: | Sinha S.B., Biswas A., Biswal M.P. |
In this paper the new linear programming algorithm is implemented for higher degree of difficulty geometric programming problems. Geometric programming problem is transformed to a linear programming problem by linearizing the geometric programming problem, using the condensation technique or by posybinomial method. After transforming the problem to a standard linear programming problem the ellipsoid algorithm is used to solve the problem.