Improving Karmarkar's method for optimal solution
In this paper we improve the Karmarkar's method for linear programming by using the vector of initial point with all iteration, and when , we see that the Karmaker's method can be reduced to a direct method without iteration and grantee the optimal solution. Finally the new method have b...
| Format: | Article |
|---|---|
| Language: | Arabic |
| Published: |
College of Computer Science and Mathematics, University of Mosul
2010-12-01
|
| Series: | المجلة العراقية للعلوم الاحصائية |
| Online Access: | https://stats.mosuljournals.com/article_28412_c7f5cb7a66b9f60e5d258b11c338b4f0.pdf |
| Summary: | In this paper we improve the Karmarkar's method for linear programming by using the vector of initial point with all iteration, and when , we see that the Karmaker's method can be reduced to a direct method without iteration and grantee the optimal solution. Finally the new method have been compared with Karmaker's. The numerical results show that the new method is better and faster. |
|---|---|
| ISSN: | 1680-855X 2664-2956 |