« Previous « Start » Next »
13 GLC Problem
The
global mixed-integer nonlinear programming (
glc)
problem is defined as
|
|
|
f(x) |
| |
|
| s/t |
| −∞ < |
xL |
≤ |
x |
≤ |
xU |
< ∞ |
| |
bL |
≤ |
A x |
≤ |
bU |
|
| |
cL |
≤ |
c(x) |
≤ |
cU, |
xj  N  j I, |
|
|
(15) |
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 files define a problem in TOMVIEW.
File: quickguide/glcQG_F.vi, glcQG_C.vi
f: Function
c: Constraints
The following file illustrates how to solve a constrained global
optimization problem in TOMVIEW. Also view the VI's specified above
for more information on the objective function and constraints.
It is possible to change the output displayed by expanding the
cluster in the block diagram.
« Previous « Start » Next »
TOMVIEW
