Is it possible to build such an objective function for a given set of constraints, so that there will be **only one** optimal solution?

My general problem is to get **any vertex** of a polytope formed by a set of given linear constraints. I need this in polynomial time.

If I use the ellipsoid method, I'll get an optimal solution for any objective function in polynomial time, BUT, this solution won't be necessary a vertex.