TOMLAB OPTIMIZATION LOGO TOMLAB OPTIMIZATION AREA top banner
  # LOGIN   # REGISTER (FREE TRIAL)
  # myTOMLAB  
Products
*TOMLAB Base Module
*TOMLAB /MINOS
*TOMLAB /NPSOL
*TOMLAB /DNOPT
*TOMLAB /SNOPT
*TOMLAB /SOL
*TOMLAB /CGO
*TOMLAB /CPLEX
*TOMLAB /GUROBI
*TOMLAB /MINLP
 *Solvers
    bqpd
    filterSQP
    minlpBB
    miqpBB
*TOMLAB /MIPNLP
*TOMLAB /MISQP
*TOMLAB /PENSDP
*TOMLAB /PENBMI
*TOMLAB /KNITRO
*TOMLAB /OQNLP
*TOMLAB /CONOPT
*TOMLAB /PROPT
*TOMLAB /NLPQL
*TOMLAB /LGO
*TOMLAB /LGO-MINLP
*TOMLAB /GP
*TOMLAB /GENO
*TOMLAB /MAD
*TOMLAB /MIDACO

minlpBB

Download by creating a myTOMLAB account.

The solver minlpBB solves large, sparse or dense mixed-integer linear, quadratic and nonlinear programming problems.

Main features

  • MINLPbb implements a branch-and-bound algorithm searching a tree whose nodes correspond to continuous nonlinearly constrained optimization problems. The continuous problems are solved using filterSQP.
     
  • MINLPbb needs second order information for the objective function and the nonlinear constraints. TOMLAB estimates any unknown derivatives, but the accuracy and convergence may be worse in such cases.
     
  • The dense and the sparse version of MINLPbb are compiled in two different MEX binaries, making the two versions optimally efficient.
     
  • MINLPbb is integrated with the TOMLAB driver routines.
     
  • MINLPbb may be used as subproblem solver in the TOMLAB environment.
     

    Tomlab © 1989-2018. All rights reserved.    Last updated: May 24, 2018. Site map. Privacy Policy