# TOMVIEW  
# REGISTER (TOMVIEW)
# LOGIN  
# myTOMVIEW
TOMLAB LOGO

« Previous « Start » Next »

5  MIQP Problem

The formulation in TOMVIEW for a mixed-integer quadratic programming problem is:

 
min
x
f(x) =
1
2
xT F x + cT x
   
s/t
xL ≤ x ≤ xU,
bL ≤ A x ≤ bU,  xj ∈ N   ∀ j ∈ I
    (6)
where c, x, xL, xU ∈ Rn, A ∈ Rm1 × n, and bL,bU ∈ Rm1. The variables x ∈ I, the index subset of 1,...,n are restricted to be integers. Equality constraints are defined by setting the lower bound equal to the upper bound, i.e. for constraint i: bL(i) = bU(i).

The following VI defines this problem in TOMVIEW.
pngs/tomview_quickguide008.png
It is possible to change the output displayed by expanding the cluster in the block diagram.
pngs/tomview_quickguide009.png

« Previous « Start » Next »