On the Simplex Algorithm Initializing
This paper discusses the importance of starting point in the simplex algorithm. Three different methods for finding a basic feasible solution are compared throughout performed numerical test examples. We show that our two methods on the Netlib test problems have better performances than the classi...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2012-01-01
|
| Series: | Abstract and Applied Analysis |
| Online Access: | http://dx.doi.org/10.1155/2012/487870 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849406064442736640 |
|---|---|
| author | Nebojša V. Stojković Predrag S. Stanimirović Marko D. Petković Danka S. Milojković |
| author_facet | Nebojša V. Stojković Predrag S. Stanimirović Marko D. Petković Danka S. Milojković |
| author_sort | Nebojša V. Stojković |
| collection | DOAJ |
| description | This paper discusses the importance of starting point in the simplex algorithm. Three different methods for finding a basic feasible solution are compared throughout performed numerical test examples. We show that our two methods on the Netlib test problems have better performances than the classical algorithm for finding initial solution. The comparison of the introduced optimization softwares is based on the number of iterative steps and on the required CPU time. It is pointed out that on average it takes more iterations to determine the starting point than the number of iterations required by the simplex algorithm to find the optimal solution. |
| format | Article |
| id | doaj-art-528f7c71e6b24a8a9618bdd6dbc7a3dc |
| institution | Kabale University |
| issn | 1085-3375 1687-0409 |
| language | English |
| publishDate | 2012-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Abstract and Applied Analysis |
| spelling | doaj-art-528f7c71e6b24a8a9618bdd6dbc7a3dc2025-08-20T03:36:31ZengWileyAbstract and Applied Analysis1085-33751687-04092012-01-01201210.1155/2012/487870487870On the Simplex Algorithm InitializingNebojša V. Stojković0Predrag S. Stanimirović1Marko D. Petković2Danka S. Milojković3Faculty of Economics, University of Niš, Trg Kralja Aleksandra 11, 18000 Niš, SerbiaDepartment of Computer Science, Faculty of Sciences, University of Niš, Višegradska 33, 18000 Niš, SerbiaDepartment of Computer Science, Faculty of Sciences, University of Niš, Višegradska 33, 18000 Niš, SerbiaLEDIB Programme Component Coordinator, Nisava District, 18000 Niš, SerbiaThis paper discusses the importance of starting point in the simplex algorithm. Three different methods for finding a basic feasible solution are compared throughout performed numerical test examples. We show that our two methods on the Netlib test problems have better performances than the classical algorithm for finding initial solution. The comparison of the introduced optimization softwares is based on the number of iterative steps and on the required CPU time. It is pointed out that on average it takes more iterations to determine the starting point than the number of iterations required by the simplex algorithm to find the optimal solution.http://dx.doi.org/10.1155/2012/487870 |
| spellingShingle | Nebojša V. Stojković Predrag S. Stanimirović Marko D. Petković Danka S. Milojković On the Simplex Algorithm Initializing Abstract and Applied Analysis |
| title | On the Simplex Algorithm Initializing |
| title_full | On the Simplex Algorithm Initializing |
| title_fullStr | On the Simplex Algorithm Initializing |
| title_full_unstemmed | On the Simplex Algorithm Initializing |
| title_short | On the Simplex Algorithm Initializing |
| title_sort | on the simplex algorithm initializing |
| url | http://dx.doi.org/10.1155/2012/487870 |
| work_keys_str_mv | AT nebojsavstojkovic onthesimplexalgorithminitializing AT predragsstanimirovic onthesimplexalgorithminitializing AT markodpetkovic onthesimplexalgorithminitializing AT dankasmilojkovic onthesimplexalgorithminitializing |