StatQuest

The optimal linear-programming solution is never interior: simplex climbs only along boundary vertices

The optimum of a linear program always sits on some boundary vertex, so the simplex algorithm never searches the interior: starting from the origin, it picks a direction from the most negative column, sets the step size by the minimum ratio, and keeps moving to a more profitable adjacent vertex.