The paper presents a method for fast real-time solution of a class of multi-parametric mixed integer quadratic programs. The complexity of the problem solved in real time is significantly reduced by moving part of the computational burden off-line. In the off-line computations, the structure of the mixed integer program is explored to determine a polytopic partition of the parameter set. Each polytope is then considered to determine which integer combinations can/cannot be optimal, given that the parameter is contained in the current polytope. The real-time solution of the mixed integer program consists of a two step procedure: First it is determined which polytope contains the parameter. Then the mixed integer quadratic program is solved, taking into account only those integer combinations associated with the current polytope. If the number of integer combinations is small, the overall complexity of the real-time solution procedure will be reduced.