In this work, we analyze 3 different linear algorithms such as simplex, northeast corner, and Vogel. In the first section of the work we first give a short back story of where the different types methods come from. In the next section we explain the process of using the method to solve an example problem step by step, with each method. On the last few sections we compare the methods and explain which one is best for solving a certain case of problem.

Keywords— algorithms, simplex, northeast, Vogel.