CPLEX Test Routines in Non-Tomlab Format: Difference between revisions
From TomWiki
Jump to navigationJump to search
No edit summary |
No edit summary |
||
| Line 41: | Line 41: | ||
!Description | !Description | ||
|- | |- | ||
|[[Appendix B#abc2gap|abc2gap]]||Utility to convert a Generalized Assignment Problem (GAP) to standard form for CPLEX. | |[[CPLEX Appendix B#abc2gap|abc2gap]]||Utility to convert a Generalized Assignment Problem (GAP) to standard form for CPLEX. | ||
|- | |- | ||
|[[Appendix C#cpxbiptest|cpxbiptest]]||Test of three large binary integer linear problems. | |[[CPLEX Appendix C#cpxbiptest|cpxbiptest]]||Test of three large binary integer linear problems. | ||
|- | |- | ||
|[[Appendix C#cpxiptest|cpxiptest]]||Test of three large integer linear problems. | |[[CPLEX Appendix C#cpxiptest|cpxiptest]]||Test of three large integer linear problems. | ||
|- | |- | ||
|[[Appendix C#cpxKnaps|cpxKnaps]]||Test of knapsack problems. | |[[CPLEX Appendix C#cpxKnaps|cpxKnaps]]||Test of knapsack problems. | ||
|- | |- | ||
|[[Appendix C#xptest1|xptest1]]||Test of a Generalized Assignment Problem (GAP). | |[[CPLEX Appendix C#xptest1|xptest1]]||Test of a Generalized Assignment Problem (GAP). | ||
|- | |- | ||
|[[Appendix C#cpxTest2|cpxTest2]]||Test of the same GAP problem as ''cpxTest1'', but using sos1 variables. | |[[CPLEX Appendix C#cpxTest2|cpxTest2]]||Test of the same GAP problem as ''cpxTest1'', but using sos1 variables. | ||
|- | |- | ||
|[[Appendix C#cpxTest3|cpxTest3]]||Test of a Generalized Assignment Problem (GAP). | |[[CPLEX Appendix C#cpxTest3|cpxTest3]]||Test of a Generalized Assignment Problem (GAP). | ||
|} | |} | ||
</figtable> | </figtable> | ||
Revision as of 12:29, 22 August 2011
|
|
This page is part of the CPLEX Manual. See CPLEX. |
A set of test routines have been defined illustrating the use of the cplex main routine. The test routines and utilities are shown in <xr id="tab:routUtil" />.
It is easy to call the test routines, e.g.
x = cpxtest1; x = cpxtest2; x = cpxtest3;
will call the three routines solving GAP problems. The cpxaircrew test problem has no input parameters, just call:
cpxaircrew;
The knapsack test routine runs three test examples. It is possible to change the cut strategy (second input parameter). To run the second test example, using aggressive cuts, the call is
cpxKnaps(2,2);
The first parameter selects the test problem. Calling without any parameters
cpxKnaps
is the same as the call
cpxKnaps(1,0);
<figtable id="tab:routUtil">
| Function | Description |
|---|---|
| abc2gap | Utility to convert a Generalized Assignment Problem (GAP) to standard form for CPLEX. |
| cpxbiptest | Test of three large binary integer linear problems. |
| cpxiptest | Test of three large integer linear problems. |
| cpxKnaps | Test of knapsack problems. |
| xptest1 | Test of a Generalized Assignment Problem (GAP). |
| cpxTest2 | Test of the same GAP problem as cpxTest1, but using sos1 variables. |
| cpxTest3 | Test of a Generalized Assignment Problem (GAP). |
</figtable>
