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
*TOMLAB /MIPNLP
 *Solvers
*TOMLAB /MISQP
*TOMLAB /PENSDP
*TOMLAB /PENBMI
*TOMLAB /KNITRO
*TOMLAB /OQNLP
*TOMLAB /PROPT
*TOMLAB /NLPQL
*TOMLAB /LGO
*TOMLAB /LGO-MINLP
*TOMLAB /GP
*TOMLAB /GENO
*TOMLAB /MAD
*TOMLAB /MIDACO

TOMLAB /MIPNLP

Download by creating a myTOMLAB account.

TOMLAB /MIPNLP includes two solvers for nonconvex, convex or pseudo-convex mixed-integer nonlinear programming (MINLP)

Features and capabilities

  • The solver ecpMINLP solves convex or pseudo-convex mixed-integer nonlinear programming problems using an extended cutting plane algorithm with cuts regulated by a parameter-vector alpha. Cuts and linearizations are added to MIP subproblem which is then solved by a subsolver in each iteration.
  • The solver algorithm is mainly based on the paper
    Solving Pseudo-Convex Mixed Integer Optimization Problems by Cutting Plane Techniques' Optimization and Engineering 3, 253-280, 2002, by Tapio Westerlund and Ray Pörn, but with several modifications.

  •  
  • The solver stoaMINLP is using a Single-search Tree Outer Approximation algorithm to solve Mixed-Integer NonLinear Programming (MINLP) problems. Handles both convex or nonconvex problems, but is best suited for solving convex problems. If the nonlinear subproblems are known to be convex, setting an input parameter will make the solver will run much faster.

  •  
  • TOMLAB /MIPNLP is integrated with the TOMLAB optimization environment.
     
  • The TOMLAB /MIPNLP solvers may be used as subproblem solvers in the TOMLAB environment.
     

Requirements

  • MATLAB 6.5 or later



    Tomlab © 1989-2022. All rights reserved.    Last updated: Oct 3, 2022. Site map. Privacy Policy