On the simplex algorithm initializing (Q1938217): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q58695314, #quickstatements; #temporary_batch_1706390585872 |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 16:44, 1 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the simplex algorithm initializing |
scientific article |
Statements
On the simplex algorithm initializing (English)
0 references
4 February 2013
0 references
Summary: This paper discusses the importance of a 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.
0 references
linear programming
0 references
optimization algorithms
0 references
simplex algorithm
0 references
mathematical software \texttt{MarPlex}
0 references