TOMLAB OPTIMIZATION LOGO TOMLAB OPTIMIZATION AREA top banner
  # LOGIN   # REGISTER (FREE TRIAL)
  # myTOMLAB  
Products
*TOMLAB Base Module
*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 /NLPQL
*TOMLAB /LGO
*TOMLAB /GP
*TOMLAB /GENO
*TOMLAB /MAD
*TOMLAB /AMPL
*TOMLAB /MIPNLP
*TOMLAB /MISQP
*TOMLAB /MIDACO
*TOMLAB /LGO-MINLP
*Coming Products

TOMLAB /OQNLP

Download by creating a myTOMLAB account.

TOMLAB /OQNLP is a multistart heuristic algorithm designed to find global optima of smooth constrained nonlinear programs (NLPs) and mixed-integer nonlinear programs (MINLPs), in cooperation with Optimal Methods, Inc.

The multistart feature calls an NLP solver with a different set of initial values and returns the feasible solutions as well as the optimal point. The starting points are calculated from scatter search algorithm, see www.opttek.com for additional information. The user may also choose to use uniformly distributed initial values. Neither of the two options guarantee that a global optimum is obtained, however the likelihood is high.

The OQNLP solver has a built-in feasible path GRG solver, LSGRG2.

The main advantage with OQNLP for smooth problems is that good local solutions are easily obtained, and that integer variables are handled.

For more information about TOMLAB /OQNLP see the TOMLAB /OQNLP User's Guide.

For user's guides to all TOMLAB products see the Manual section.


    Tomlab Optimization © 1989-2016. All rights reserved.    Last updated: Oct 17, 2016. Site map.