In this post, we continue the design and analysis of an interior point method algorithm to solve a linear program that we started last time.

In this post, we begin describing a basic interior point method to solve a linear program. We follow material from these notes by Professor Michel Goemans (relevant lectures are 6,7 and 8), filling in the details.