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

« Previous « Start » Next »

18  GOAL Problem

The constrained goal attainment (goal) problem is defined as

 
min
x
max lam: r(x) − w * lamg
subject to xL x xU
  bL Ax bU
  cL c(x) cU
    (20)
where x,xL,xU ∈ Rn, r(x) ∈ RN, c(x),cL,cU ∈ Rm1, bL,bU ∈ Rm2, A∈ Rm2 × n, g ∈ Rm, and w ∈ Rm.

The goal solution can be obtained by the use of any suitable nonlinear TOMVIEW solver.

The following files define a problem in TOMVIEW.

File: quickguide/goalsQG_r.vi, goalsQG_J.vi, goalsQG_C.vi, goalsQG_Dc.vi
  r:   Residual function
  J:   Residual gradient matrix (Jacobian)
  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 »