I read from the wiki page of the Simplex Algorithm that we can "use Baire category theory from general topology, and to show that (topologically) "most" matrices can be solved by the simplex algorithm in a polynomial number of steps."
It looks exciting, but there is no reference on the wiki page and I can't find a reference either. Could you please give me a reference?