http://tomwiki.com/index.php?action=history&feed=atom&title=CPLEX_cpxTest3CPLEX cpxTest3 - Revision history2026-10-31T20:29:37ZRevision history for this page on the wikiMediaWiki 1.39.1http://tomwiki.com/index.php?title=CPLEX_cpxTest3&diff=977&oldid=prevElias: Created page with "{{Part Of Manual|title=the CPLEX Manual|link=CPLEX}} ==Purpose== Test routine 3, calls CPLEX Matlab level 1 interface to solve a GAP problem. ==Calling Syntax== <pre..."2011-08-16T11:42:41Z<p>Created page with "{{Part Of Manual|title=the CPLEX Manual|link=<a href="/index.php?title=CPLEX" title="CPLEX">CPLEX</a>}} ==Purpose== Test routine 3, calls CPLEX Matlab level 1 interface to solve a GAP problem. ==Calling Syntax== <pre..."</p>
<p><b>New page</b></p><div>{{Part Of Manual|title=the CPLEX Manual|link=[[CPLEX|CPLEX]]}}<br />
==Purpose==<br />
<br />
Test routine 3, calls CPLEX Matlab level 1 interface to solve a GAP problem.<br />
<br />
==Calling Syntax==<br />
<br />
<pre><br />
x = cpxTest3<br />
</pre><br />
<br />
==Global Parameters Used==<br />
<br />
{|class="wikitable"<br />
!Parameter||Description<br />
|-<br />
|''MAX_x''||Maximal number of ''x ''elements printed in output statements. Default 20.<br />
|-<br />
|''MAX_c''||Maximal number of constraint elements printed in output statements. Default 20.<br />
|}<br />
<br />
==Description==<br />
<br />
Running a generalized assignment problem (GAP) from Wolsey [1, 9.6, pp159]. In this test the linear sos1 constraints are defined explicitly.<br />
<br />
Given the matrices ''A ''(constraints) and ''C ''(costs), ''cpxTest1 ''is using the utility ''abc2gap ''to reformulate the problem into the standard form suitable for CPLEX.<br />
<br />
The number of iterations are increased, no presolve is used, and no cut strategy is used.<br />
<br />
==M-files Used==<br />
<br />
''abc2gap.m'', ''cplex.m''<br />
<br />
==See Also==<br />
<br />
''cpxTest2''</div>Elias