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

Linear Programming (LP)

Recommended Downloads:

TOMLAB /GUROBI
TOMLAB /CPLEX

Linear programming problems are solved most efficiently with TOMLAB /GUROBI, TOMLAB /CPLEX and TOMLAB /XA. Problems with millions of variables are possible to solve where the available memory is the limit. These packages include both simplex based algorithms and barrier methods. TOMLAB /CPLEX also includes a special network algorithm. For less time-critical problems, TOMLAB /MINOS is recommended. For LP, the package includes the sparse solver MINOS, and the dense solver LPOPT. Even if MINOS is really an NLP solver, it is designed to be very efficient for LPs and QPs as well, and has been regarded a reliable high-quality solver for more than twenty years. Advanced scaling features and warm-start facilities make it a good choice when solving large sets of LPs and QPs.

Almost all other solvers can be used to solve LPs. Three simplex based large-scale sparse alternatives are SQOPT in TOMLAB /SNOPT, CONOPT in TOMLAB /CONOPT and BQPD in TOMLAB /MINLP. PDCO in the TOMLAB Base Module is a good barrier solver. Simplex based medium-scale LP solvers in the TOMLAB Base Module are lpSolve and the QP solver QLD.

Solver reference:

TOMLAB /MINOS - MINOS
TOMLAB /MINOS - LPOPT
TOMLAB /SOL - SQOPT
TOMLAB /CONOPT
TOMLAB /MINLP - BQPD
TOMLAB /KNITRO
TOMLAB Base Module - PDCO
TOMLAB Base Module - milpSolve
TOMLAB Base Module - QLD

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