SUMMARY
The article is devoted to the problem of convex functions optimization on combinatorial sets. Estimates for convex function minimum are constructed for different classes of combinatorial sets of permutations, with or without linear constraints on the variables. Estimates construction includes an additional procedure of optimization. Examples are given; results of numerical experiments are analyzed.