Enhancements on the Hyperplane Arrangements in Mixed Integer Techniques

Abstract : The current paper addresses the problem of optimizing a cost function over a non-convex and possibly non-connected feasible region. A classical approach for solving this type of optimization problem is based on Mixed integer technique. The exponential complexity as a function of the number of binary variables used in the problem formulation highlights the importance of reducing them. Previous work which minimize the number of binary variables is revisited and enhanced. Practical limitations of the procedure are discussed and a typical control application, the control of Multi-Agent Systems is exemplified.
Document type :
Conference papers
Complete list of metadatas

https://hal-supelec.archives-ouvertes.fr/hal-00657868
Contributor : Josiane Dartron <>
Submitted on : Monday, January 9, 2012 - 3:25:32 PM
Last modification on : Monday, September 17, 2018 - 12:18:26 PM

Identifiers

Collections

Citation

Florin Stoican, Ionela Prodan, Sorin Olaru. Enhancements on the Hyperplane Arrangements in Mixed Integer Techniques. 2011 50th IEEE Conference on Decision and Control and European Control Conference, Dec 2011, Orlando, Floride,, United States. ⟨10.1109/CDC.2011.6161361⟩. ⟨hal-00657868⟩

Share

Metrics

Record views

158