We develop a condition-based complexity analysis for homogenous polyhedra with real number data. We analyze the dependency of primal-dual interior point algorithm efficiency on this condition number for finding a point in a polyhedron. Key Words: polyhedron, interior point algorithms, condition-based complexity.