I'm currently working on a LP and want to compare different implementations of the revised simplex and IP methods to solve it.

The LP has a size of 200*200.
The problem itself could be interpreted as a transportation problem.
Due to the problem structure I do have 40.000 constraints.
I'm using numpy matrices as input.

The solving time of the revised simplex for this is 16 minutes.
The solving time of the interior point method is about 11 minutes.

Are those old methods really that slow or am I doing something wrong?

Thanks in advance.

I'm working on a windows machine with 16gb ram and i7.