This paper theoretical1y solves the problem of decomposition of the general quadratic programming and proves that the programming after decomposition is also locally quadratic. Section 1 consists of the general problem of decomposition and the main result. Section 2 is a preliminary and section 3 presents a prove for the main result.