In this paper, we explore a weakness of a specific implementation of the analytic center cutting plane method applied to convex optimization problems, which may lead to weaker results than Kelley's cutting plane method. Improvements to the analytic center cutting plane method are suggested, and tested on some example problems.