Does interior point algorithm of function linprog include crossover process?

Greetings,

I am currently working on a linear programming problem solved by function linprog. Different results were obtained when I used dual simplex and interior point methods. It seems that there are multiple optimal solutions to this problem. One possibility is that interior point led to a different vertex from the one of dual simplex. Another possibility is that there is no crossover process in interior point method, so I got a optimal solution not at the vertex.

Can anyone tell me whether there is crossover process in interior-point method or not？