The problem of finding a Hamiltonian path in the graph-blocking full factorial experiment. A variant formulation of the problem, when a route is determined only by the number of quality factors of level changes. The possibility of solving this problem by the branch and bound. It is shown that this method can not be used to solve the problem, in which the number exceeds four factors. A simple method nonexhaustive exact solution of our problem. We consider other, more complex variants of this problem, leading to a two-criteria scheme. At the same time to solve the problem proposed by Pareto approach. Examples.
multivariable experiment, fullaccessible count, гамильтонов way, method of construction of optimum route, twocriterion optimization of route, Pareto-great number of decisions