TOMLAB OPTIMIZATION LOGO TOMLAB OPTIMIZATION AREA top banner
  # LOGIN   # REGISTER (TOMLAB) MSN LIVE SUPPORT
MSN LIVE SUPPORT
  # myTOMLAB  
Products
*TOMLAB Base Module
 *Solvers
    clsSolve
    conSolve
    cutPlane
    DualSolve
    expSolve
    glbDirect
    glbFast
    glbSolve
    glcCluster
    glcDirect
    glcFast
    glcSolve
    goalSolve
    infLinSolve
    infSolve
    L1LinSolve
    L1Solve
    linRatSolve
    lpSimplex
    lsei
    milpSolve
    mipSolve
    multiMin
    nlpSolve
    pdco
    pdsco
    QLD
    qpSolve
    slsSolve
    sTrustr
    Tfmin
    Tfzero
    Tlsqr
    Tnnls
    ucSolve
*TOMLAB /MINOS
*TOMLAB /NPSOL
*TOMLAB /SNOPT
*TOMLAB /SOL
*TOMLAB /CGO
*TOMLAB /Xpress
*TOMLAB /CPLEX
*TOMLAB /GUROBI
*TOMLAB /MINLP
*TOMLAB /PENSDP
*TOMLAB /PENBMI
*TOMLAB /KNITRO
*TOMLAB /OQNLP
*TOMLAB /CONOPT
*TOMLAB /PROPT
*TOMLAB /XA
*TOMLAB /NLPQL
*TOMLAB /LGO
*TOMLAB /GP
*TOMLAB /GENO
*TOMLAB /MAD
*TOMLAB /AMPL
*Coming Products

goalSolve

Solves sparse multi-objective goal attainment problems, with linear and nonlinear constraints.

Main features

  • Reformulates the multi-objective goal problem into a general nonlinear program, where the function residuals are included among the nonlinear constraints. The sparsity of the Jacobian of the function residuals are thereby exploited, as this Jacobian is part of the nonlinear constraint Jacobian after the reformulation.
     
  • Any sparse nonlinear Tomlab solver may be used to solve the nonlinear program formulation. Recommended is to use SNOPT.
     

    Tomlab Optimization © 1989-2009. All rights reserved.    Last updated: Dec 7, 2009. Site map.