Our current research is divided into two broad areas: (i) computational experiments on our (recently proposed) strongly polynomial-time algorithm for the general linear programming (LP) problem, and (ii) practical computation and applications of nonstationary Markov chains. The LP algorithm is described at www.arxiv.org in two parts as arXiv:2310.05855 [math.OC] and arXiv:2309.01037. An article on this algorithm, entitled “A strongly polynomial-time algorithm for the general linear programming problem”, has been submitted for a journal review. Our healthcare-motivated article entitled “Computation and applications of limits of certain non-stationary Markov chains” (2023) is available as arXiv:2309.10974 [math.PR]; this article too has been submitted for a journal review.