Enhancements on the Hyperplanes Arrangements in Mixed-Integer Programming Techniques

Ionela Prodan 1, 2 Florin Stoican 3 Sorin Olaru 1 Silviu-Iulian Niculescu 4, 5
4 DISCO - Dynamical Interconnected Systems in COmplex Environments
L2S - Laboratoire des signaux et systèmes, Inria Saclay - Ile de France, SUPELEC, CNRS - Centre National de la Recherche Scientifique : UMR8506
5 Division Systèmes - L2S
L2S - Laboratoire des signaux et systèmes : 1289
Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

Contributor : Josiane Dartron <>
Submitted on : Monday, November 12, 2012 - 4:52:38 PM
Last modification on : Tuesday, June 4, 2019 - 11:08:06 AM

Links full text



Ionela Prodan, Florin Stoican, Sorin Olaru, Silviu-Iulian Niculescu. Enhancements on the Hyperplanes Arrangements in Mixed-Integer Programming Techniques. Journal of Optimization Theory and Applications, Springer Verlag, 2012, 154 (2), pp.549-572. ⟨10.1007/s10957-012-0022-9⟩. ⟨hal-00750934⟩



Record views