Mathematical Model on Set of Partial Permutations for the optimization of Complex Information Systems

The article is devoted to the problem of constructing and solving mathematical models of applied problems as problems on combinatorial configurations. This question is actual branch because any task of optimal design of complex economic and technical systems, technological devices, planning and management etc. requires that the desired solution be found consider of combinatory properties of the problem.It is used transfer to Euclidian combinatorial configurations and using of discrete optimizations methods. Method for solving such problems is considered and it includes the analyzing of structural graph of Euclidean combinatorial configurations sets.