Changeset 2481
 Timestamp:
 Feb 9, 2019 6:41:47 AM (21 months ago)
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

trunk/Cbc/test/gamsTest.cpp
r2469 r2481 97 97 solver1.setObjSense(1); 98 98 99 CbcSolverUsefulData data; 99 100 CbcModel model(solver1); 100 CbcMain0(model );101 CbcMain0(model, data); 101 102 102 103 int which[3] = { 0, 1, 2 }; … … 106 107 107 108 const char *argv2[] = { "gamstest_sos1a", "solve", "quit" }; 108 CbcMain1(3, argv2, model );109 CbcMain1(3, argv2, model, data); 109 110 cout << endl; 110 111 if (!model.isProvenOptimal()) { … … 289 290 } 290 291 CbcModel model(solver1); 291 CbcMain0(model); 292 CbcSolverUsefulData data; 293 CbcMain0(model, data); 292 294 int which[3] = { 0, 1, 2 }; 293 295 CbcObject *sosobject = new CbcSOS(&model, 3, which, NULL, 0, 2); … … 296 298 const char *argv2[] = { "gamstest_sos2a", "solve", "quit" }; 297 299 cout << "\nSolving sos2a model with w1 having lower bound " << solver1.getColLower()[0] << endl; 298 CbcMain1(3, argv2, model );300 CbcMain1(3, argv2, model, data); 299 301 cout << endl; 300 302 if (!model.isProvenOptimal()) { … … 403 405 for (int testcase = 0; testcase < 5; ++testcase) { 404 406 CbcModel model(solver1); 405 CbcMain0(model); 407 CbcSolverUsefulData data; 408 CbcMain0(model, data); 406 409 407 410 double points[4] = { 0., 0., 0., 10. }; … … 477 480 << endl; 478 481 const char *argv2[] = { "gamstest_semicon1", "solve", "quit" }; 479 CbcMain1(3, argv2, model );482 CbcMain1(3, argv2, model, data); 480 483 cout << endl; 481 484 if (!model.isProvenOptimal()) { … … 613 616 for (int testcase = 0; testcase < 6; ++testcase) { 614 617 CbcModel model(solver1); 615 CbcMain0(model); 618 CbcSolverUsefulData data; 619 CbcMain0(model, data); 616 620 617 621 double points[10]; … … 710 714 << endl; 711 715 const char *argv2[] = { "gamstest_semiint1", "solve", "quit" }; 712 CbcMain1(3, argv2, model );716 CbcMain1(3, argv2, model, data); 713 717 cout << endl; 714 718 if (!model.isProvenOptimal()) {
Note: See TracChangeset
for help on using the changeset viewer.