« Previous « Start » Next »
9 MINLP Problem
The
mixed-integer nonlinear programming (
minlp)
problem is defined as
|
|
|
f(x) |
| |
|
| s/t |
| −∞ < |
xL |
≤ |
x |
≤ |
xU |
< ∞ |
| |
bL |
≤ |
A x |
≤ |
bU |
|
| |
cL |
≤ |
c(x) |
≤ |
cU, |
xj  N  j I, |
|
|
(11) |
where
x,
xL,
xU Rn,
f(
x)
R,
A
Rm1 × n,
bL,
bU Rm1
and
cL,
c(
x),
cU Rm2. The variables
x I,
the index subset of 1,...,
n, are restricted to be integers.
The following VI's define a problem in TOMVIEW.
File: quickguide/minlpQG.vi, minlpQG_F.vi, minlpQG_G.vi, minlpQG_C.vi and
minlpQG_Dc.vi
f: Function value
g: Gradient vector
c: Nonlinear constraint vector
dc: Nonlinear constraint gradient matrix
The following VI illustrates how to solve a MINLP problem in
TOMVIEW. Also view the other VI's specified above for more
information.
It is possible to change the output displayed by expanding the
cluster in the block diagram.
« Previous « Start » Next »
TOMVIEW
