The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program. which possesses many locally optimal values. resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper. https://thewooblers.shop/product-category/beginner/