On Solution Method of the Knapsack Problem

摘要

In this paper we give original geometrical interpretation to the domain of definition of integer and combinatorical problems. The solution of the problems concerning NP class has been carried out on the hyperarchs. The existence criterion of the solution on the hyperarchs has been defined. The method for establishing the sequence of approximation to the solution on the hyperarchs was constructed. Calculation experiments were conducted, and the obtained polynomial algorithm, practically solved exactly the (SSP) problem.