Semidefinite programming(SDP) is an extension of linear programming, and the interior-point algorithm is the most effective method for semidefinite programming. Studies semidefinite programming sensitivity analysis based on interior point algorithm, that is perturbations impacts of right-end vector and cost matrix on practical solutions. And in the single-step interior point iteration presents the parameters of the boundaries at practical domain and approximate optimal solution and the general conditions of sensitivity analysis.