Before revision:  We design a simplex algorithm that , given an initial vertex, reaches an optimal vertex by tracing a path along the edges of P of length at most O(n ^6 klog k ).
After revision:  We design a simplex algorithm that , given an initial vertex, reaches an optimal vertex by tracing a path along the edges of P of length at most O(n ^4 k\log(nk ).