TOMNET Optimization

The page lists the best solver options for a variety of problem areas. Other solvers may be equally good or better but we recommend to start an evaluation with the options below.

• Linear programming (sparse) - TOMNET /CPLEX and TOMNET /MINOS - MINOS
   
• Linear programming (dense) - TOMNET /CPLEX and TOMNET /MINOS - QPOPT
   
• Mixed-Integer programming - TOMNET /CPLEX
   
• Quadratic programming (sparse) - TOMNET /SNOPT - SQOPT
   
• Quadratic programming (dense) - TOMNET /SNOPT - QPOPT
   
• Mixed-Integer Quadratic programming (with quadratic constraints) - TOMNET /CPLEX
   
• Nonlinear programming (sparse) - TOMNET /SNOPT - SNOPT
   
• Nonlinear programming (dense) - TOMNET /NPSOL - NPSOL
   
• Linear Least Squares (sparse) - TOMNET /NPSOL - LSQR
   
• Linear Least Squares (dense) - TOMNET /NPSOL - LSSOL
   
• Nonlinear Least Squares (sparse) - TOMNET /BASE - slssolve in conjunction with TOMNET /SNOPT - SNOPT
   
• Nonlinear Least Squares (dense) - TOMNET /NPSOL - NLSSOL
   
• Box-bounded (unconstrained) global optimization - TOMNET /BASE - glbDirect
   
• Mixed-Integer constrained global optimization - TOMNET /BASE - glcDirect
   
• Minimax optimization (Infinity norm) - TOMNET /BASE - infsolve in conjunction with TOMNET /SNOPT - SNOPT
   
• Linear Minimax optimization (Infinity norm) - TOMNET /BASE - inflinsolve in conjunction with TOMNET /CPLEX
   
• L1 optimization (Abs norm) - TOMNET /BASE - L1solve in conjunction with TOMNET /SNOPT - SNOPT
   
• Linear L1 optimization (Abs norm) - TOMNET /BASE - L1linsolve in conjunction with TOMNET /CPLEX
   
• Goal attainment problems - TOMNET /BASE - goalsolve in conjunction with TOMNET /SNOPT - SNOPT