Let $f=\mathbf{c}\cdot\mathbf{x}$ be the optimization objective function whose parameter vector $\mathbf{x}\in\mathbb{R}^n$ is subject to the following constraints in the very well-known linear-programming problem $$ \mathbf{A}\mathbf{x}=\mathbf{b}\in\mathbb{R}^m\;,\quad \mathbf{0}\leq\mathbf{x}\leq\mathbf{v} $$ Suppose that the space of feasible solutions of the above linear system is a convex polytope; my questions are the following:

How are the vertices of said polytope found in linear programming? Kindly reference the theoretical argument for that.

What are the MCMC algorithms to sample points from the polytope s.t. it eventually finds the optimal point for the object function?