Navigation: HOME - TOMLAB - ABOUT - PRODUCTS - OPTIMIZATION - DOWNLOAD - ORDER - SERVICES - COMPANY - SITE MAP

		LOGIN			REGISTER (FREE TRIAL)
		myTOMLAB



	Products

	TOMLAB Base Module
		Solvers
		clsSolve
		conSolve
		cutPlane
		DualSolve
		expSolve
		glbDirect
		glbFast
		glbSolve
		glcCluster
		glcDirect
		glcFast
		glcSolve
		goalSolve
		infLinSolve
		infSolve
		L1LinSolve
		L1Solve
		linRatSolve
		lpSimplex
		lsei
		milpSolve
		minlpSolve
		mipSolve
		multiMin
		multiMINLP
		nlpSolve
		pdco
		pdsco
		QLD
		qpSolve
		slsSolve
		sTrustr
		Tfmin
		Tfzero
		Tlsqr
		Tnnls
		ucSolve


	TOMLAB /MINOS

	TOMLAB /NPSOL

	TOMLAB /DNOPT

	TOMLAB /SNOPT

	TOMLAB /SOL

	TOMLAB /CGO

	TOMLAB /CPLEX

	TOMLAB /GUROBI

	TOMLAB /MINLP

	TOMLAB /MIPNLP

	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

cutPlane

The Tomlab solver cutPlane.m solves mixed-integer linear programming problems (MIP) with equality constraints using a cutting plane algorithm with LP relaxation.

Main features

All decision variables have to be greater than or equal to zero.
Selectable LP and dual LP solver.