TOMLAB OPTIMIZATION LOGO TOMLAB OPTIMIZATION AREA top banner
  # LOGIN   # REGISTER (FREE TRIAL)
  # myTOMLAB  
Optimization
*Linear Programming
*Quadratic Programming
*Unconstrained Optimization
*Constrained Optimization, Nonlinear Programming
*Linear Least Squares
*Constrained Nonlinear Least Squares
*Box-bounded Global Optimization
*Global Optimization, costly functions
*Mixed-Integer Programming
*Mixed-Integer Quadratic Programming
*Mixed-Integer Nonlinear Programming
*Semi-definite Programming

Mixed-Integer Programming

Recommended Downloads:

TOMLAB /GUROBI
TOMLAB /CPLEX

Large-scale mixed-integer problems are handled by several packages. The high-end products TOMLAB /GUROBI and TOMLAB /CPLEX implements branch- and cut search algorithms, that includes the latest research on cut- and presolve techniques. The packages includes both barrier and simplex based solver options. For problems in the order of a thousand unknowns, and less time requirements, there are two solvers implementing branch- and bound algorithms: miqpBB in TOMLAB /MINLP and mipSolve in the TOMLAB Base Module. mipSolve should be combined with MINOS for maximum efficiency.

Solver reference:

TOMLAB Base Module - mipSolve with TOMLAB /MINOS - MINOS
TOMLAB /MINLP - miqpBB

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