A Preprocessing Algorithm for MIQP Solvers with Applications to MPC
2004 (English)In: Proceedings of the 43rd IEEE Conference on Decision and Control, 2004, 2497-2502 p.Conference paper (Refereed)
In this paper a preprocessing algorithm for unconstrained mixed integer quadratic programming problems and binary quadratic programming problems is presented. The algorithm applies to problems with certain properties, which are further described in the paper. When the algorithm is applied to a problem with these properties, the optimal value for some or all integer variables can be computed without approximations in polynomial time. The algorithm is first derived for the binary quadratic programming problem and the resultis then extended to the mixed integer quadratic programming problem by transforming the latter problem into the first problem. Both mentioned quadratic programming problems have several important applications. In this paper, the focus is on model predictive control problems with both real-valued and binary control signals. As an illustration of the method, the algorithm is applied to two different problems of this type.
Place, publisher, year, edition, pages
2004. 2497-2502 p.
Predictive control, Integer programming, Quadratic programming
Engineering and Technology Control Engineering
IdentifiersURN: urn:nbn:se:liu:diva-12902DOI: 10.1109/CDC.2004.1428790ISBN: 0-7803-8682-5OAI: oai:DiVA.org:liu-12902DiVA: diva2:17352
43rd IEEE Conference on Decision and Control, Paradise Island, Bahamas, December, 2004