A theoretical comparison between the simplex method and the basic line search algorithm |
| |
| Authors: | Mahesh N. Dumaldar |
| |
| Affiliation: | 1. School of Mathematics, Devi Ahilya University, Indore, India.mn_dumaldar@yahoo.comdumaldar.math@dauniv.ac.in |
| |
| Abstract: | A theoretical comparison between the simplex method (SM) and the basic line search method (BLSA) is presented. The explicit formulae for the upper and lower bounds in the BLSA are provided using SM. Further, it is shown that both methods are operationally equivalent. |
| |
| Keywords: | linear programming simplex method basic line search algorithm |
|
|
