Q:

Solving a linear program with an active set method

Is it possible to solve a linear program with an active set method? If so what would be the similarities and differences to the simplex method?

A:

Yes, it would be called the Simplex algorithm.
An active set method for solving Quadratic Programming problems is often called a "Simplex algorithm" (which is as opposed to an Interior Point method).

