CPLEX cpxiptest

From TomWiki
Revision as of 05:18, 16 August 2011 by Elias (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigationJump to search

Notice.png

This page is part of the CPLEX Manual. See CPLEX.

Purpose

Test of the TOMLAB /CPLEX level 1 interface solving three larger integer linear optimization problems calling the CPLEX solver.

Calling Syntax

function cpxiptest(Cut, PreSolve, cpxControl)

Description of Input

Input Description
Cut Value of the cut strategy parameters, default Cut = -1.

Cut = -1, auto select of Cut = 1 or Cut = 2.

Cut = 0, no cuts. Cut = 1, conservative cut strategy.

Cut = 2, aggressive cut strategy

See CPLEX cpxbiptest.

PreSolve Value of the PRESOLVE control parameter, default PreSolve = 1.

PreSolve = 0, no presolve.

PreSolve = 1, do presolve.

cpxControl The initial cpxControl structure. Here the user may set additional control parameter. Default empty.

Global Parameters Used

Output Description
MAX_x Maximal number of x elements printed in output statements. Default 20.
MAX_c Maximal number of constraint elements printed in output statements. Default 20.

Description

Test of three larger integer linear optimization problems calling the CPLEX solver. The test problems have 61 variables and 138 linear inequalities. 32 of the 138 inequalities are just zero rows in the matrix A. The three problems are stored in ilp061.mat, ilp062.mat and ilp063.mat.

Code is included to remove the 32 zero rows, and compute better upper bounds using the positivity of the matrix elements, right hand side and the variables. But this does not influence the timing much, the CPLEX presolve will do all these problem changes.

Timings are made with the Matlab functions tic and toc.

M-files Used

cplex, xprinti, cpxPrint