This work provides a new method of obtaining optimizers of response functions. The method uses line search techniques and it is particularly useful for linear programming problems. The focus is to reach the optimizer in the fewest number of iterations. The method has been compared with simplex method, active set method, Linear Exchange algorithm (LEA), Quadratic exchange algorithm (QEA), and Minimum norm exchange algorithm (MNEA) and is found comparatively efficient. Numerical demonstrations prove effectiveness of the new method.
Digital Object Identifier (DOI)
Odiakosa, Osita and Iwundu, Mary
"A Quick Convergent Inflow Algorithm for Solving Linear Programming Problems,"
Journal of Statistics Applications & Probability: Vol. 2:
2, Article 3.
Available at: https://digitalcommons.aaru.edu.jo/jsap/vol2/iss2/3