2017
Том 69
№ 9

All Issues

Irreducible System of Constraints for a General Polyhedron of Arrangements

Emets O. A., Nedobachii S. I., Roskladka О. V.

Full text (.pdf)


Abstract

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.

English version (Springer): Ukrainian Mathematical Journal 55 (2003), no. 1, pp 1-12.

Citation Example: Emets O. A., Nedobachii S. I., Roskladka О. V. Irreducible System of Constraints for a General Polyhedron of Arrangements // Ukr. Mat. Zh. - 2003. - 55, № 1. - pp. 3-11.

Full text