On finding new vertices and redundant constraints in cutting plane algorithms for global optimization