313 Spl. Independentei 060042 Bucharest, Romania
On the hyperplanes arrangements in mixed-integer techniques
F. Stoican, Prodan, I., and Olaru, S., “On the hyperplanes arrangements in mixed-integer techniques”, in Proceedings of the 30th American Control Conference, San Francisco, California, USA, 2011, p. 1898–1903.
This paper is concerned with the improved constraints handling in 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 non-connected union of such convex sets is detailed. In order to illustrate the benefits of the proposed improvements, a practical implementation, the problem of obstacle avoidance using receding horizon optimization techniques is considered.