Dr. Awoniyi's research divides into two broad areas: (i) computational experiments on our recent algorithm for the general linear programming (LP) problem, and (ii) practical healthcare applications of Markov chain sojourn-time cycle (STC).
We believe that our recent algorithm for the general LP problem is strongly polynomial-time, and this claim is currently under a journal review. Anyone who is interested in having a .pdf copy of this article may send a request by e-mail to awoniyi@eng.famu.fsu.edu.
We are also working on extensions and industry-grade healthcare applications of our recent Markov chain computation article “Case for First Courses on Finite Markov Chain Modeling to Include Sojourn Time Cycle Chart" (Samuel Awoniyi & Ira Wheaton), SIAM Review (2019) Vol. 61, No. 2, pp. 347–360