Roskladka О. V.
Ukr. Mat. Zh. - 2003. - 55, № 1. - pp. 3-11
We construct a system of constraints for a general polyhedron of arrangements that does not contain superfluous inequalities. The derivation of an irreducible system enables one to substantially reduce the number of operations necessary for finding exact solutions of optimization problems on arrangements.
Ukr. Mat. Zh. - 1999. - 51, № 8. - pp. 1118–1121
On the basis of the approach proposed, we obtain new estimates of extremal values of strongly convex differentiable functions and strengthened estimates of minima on a set of combinations with repetions.