Enhancements on the Hyperplanes Arrangements in Mixed-Integer Programming Techniques.

This paper is concerned with improvements in constraints handling for mixed-integer optimization problems. The novel element is the reduction of the number of binary variables used for expressing the complement of a convex (polytopic) region. As a generalization, the problem of representing the complement of a possibly not connected union of such convex sets is detailed. In order to illustrate the benefits of the proposed improvements, a typical control application, the control of multiagent systems using receding horizon optimization techniques, is considered. [ABSTRACT FROM AUTHOR]