Abstract: A cut plane algorithm for semidefinite programming is presented in this paper, which relaxs the semidefinite programming to a linear programming, thus solving large scale semidefinite programming effeciently. Its covergence is proved. As an applications, a numerical example of the Max-cut problem is given.

Key words: semidefinite programming, cut-plane, linear relaxation, Max-cut problem