Tulip is an Interior-Point solver written entirely in Julia. It uses a standard Primal-Dual Predictor-Corrector algorithm to solve Linear Programs (LPs).
Tulip solves LPs of the form:
$$
\begin{array}{rrl}
(P) \ \ \
\displaystyle \min_{x} & c^{T}x\
s.t.
& Ax &=b\
& x & \leq u\
& x & \geq 0\
\end{array}
$$
where
It uses a primal-dual predictor-corrector interior point.