Changeset 1427:57abff252556 in lemon
- Timestamp:
- 01/20/21 16:17:21 (4 years ago)
- Branch:
- default
- Phase:
- public
- Files:
-
- 5 edited
Legend:
- Unmodified
- Added
- Removed
-
cmake/FindILOG.cmake
r1331 r1427 97 97 IF(CMAKE_SYSTEM_NAME STREQUAL "Linux") 98 98 # SET(CPLEX_LIBRARIES "${CPLEX_LIBRARIES};m;pthread") 99 SET(ILOG_LIBRARIES ${ILOG_LIBRARIES} "m" "pthread" )99 SET(ILOG_LIBRARIES ${ILOG_LIBRARIES} "m" "pthread" "dl") 100 100 ENDIF(CMAKE_SYSTEM_NAME STREQUAL "Linux") 101 101 ENDIF(ILOG_FOUND) -
lemon/clp.cc
r1336 r1427 228 228 229 229 ClpLp::Value ClpLp::_getCoeff(int ix, int jx) const { 230 CoinBigIndex begin = _prob->clpMatrix()->getVectorStarts()[ ix];231 CoinBigIndex end = begin + _prob->clpMatrix()->getVectorLengths()[ ix];230 CoinBigIndex begin = _prob->clpMatrix()->getVectorStarts()[jx]; 231 CoinBigIndex end = begin + _prob->clpMatrix()->getVectorLengths()[jx]; 232 232 233 233 const int* indices = _prob->clpMatrix()->getIndices(); 234 234 const double* elements = _prob->clpMatrix()->getElements(); 235 235 236 const int* it = std::lower_bound(indices + begin, indices + end, jx);237 if (it != indices + end && *it == jx) {236 const int* it = std::lower_bound(indices + begin, indices + end, ix); 237 if (it != indices + end && *it == ix) { 238 238 return elements[it - indices]; 239 239 } else { -
lemon/cplex.cc
r1349 r1427 159 159 const char s = 'R'; 160 160 double len = ub - lb; 161 CPXaddrows(cplexEnv(), _prob, 0, 1, values.size(), & ub, &s,161 CPXaddrows(cplexEnv(), _prob, 0, 1, values.size(), &lb, &s, 162 162 &rmatbeg, &indices.front(), &values.front(), 0, 0); 163 163 CPXchgrngval(cplexEnv(), _prob, 1, &i, &len); -
test/lp_test.cc
r1337 r1427 340 340 check(lp.sense() == lp.MAX,"This is a maximization!"); 341 341 check(lp.coeff(upright,x1)==1,"The coefficient in question is 1!"); 342 check(lp.coeff(upright,x2)==2,"The coefficient in question is 1!"); 342 343 check(lp.colLowerBound(x1)==0, 343 344 "The lower bound for variable x1 should be 0."); … … 425 426 } 426 427 428 template<class LP> 429 void rangeConstraintTest() 430 { 431 LP lp; 432 // Add two columns (variables) to the problem 433 typename LP::Col x1 = lp.addCol(); 434 typename LP::Col x2 = lp.addCol(); 435 // Add rows (constraints) to the problem 436 lp.addRow(x1 - 5 <= x2); 437 lp.addRow(0 <= 2 * x1 + x2 <= 25); 438 439 // Set lower and upper bounds for the columns (variables) 440 lp.colLowerBound(x1, 0); 441 lp.colUpperBound(x2, 10); 442 443 // Specify the objective function 444 lp.max(); 445 lp.obj(5 * x1 + 3 * x2); 446 447 // Solve the problem using the underlying LP solver 448 lp.solve(); 449 // Print the results 450 check(lp.primalType() == LP::OPTIMAL, "Optimal solution is not found"); 451 check(lp.primal() <= 67.501 && lp.primal() >= 67.499, "Wrong objective value"); 452 check(lp.primal(x1) <= 7.501 && lp.primal(x1) >= 7.499, "Wrong value for x1"); 453 check(lp.primal(x2) <= 10.001 && lp.primal(x2) >= 9.999, "Wrong value for x2"); 454 } 455 427 456 int main() 428 457 { … … 445 474 aTest(lp_glpk2); 446 475 cloneTest<GlpkLp>(); 476 rangeConstraintTest<GlpkLp>(); 447 477 } 448 478 #endif … … 454 484 aTest(lp_cplex2); 455 485 cloneTest<CplexLp>(); 486 rangeConstraintTest<CplexLp>(); 456 487 } catch (CplexEnv::LicenseError& error) { 457 488 check(false, error.what()); … … 465 496 aTest(lp_soplex2); 466 497 cloneTest<SoplexLp>(); 498 rangeConstraintTest<Soplex>(); 467 499 } 468 500 #endif … … 474 506 aTest(lp_clp2); 475 507 cloneTest<ClpLp>(); 508 rangeConstraintTest<ClpLp>(); 476 509 } 477 510 #endif -
test/mip_test.cc
r1300 r1427 62 62 } 63 63 64 void aTest(MipSolver& mip )64 void aTest(MipSolver& mip, bool solve_empty=true) 65 65 { 66 66 //The following example is very simple … … 81 81 82 82 //Unconstrained optimization 83 mip.solve(); 83 if(solve_empty) 84 mip.solve(); 84 85 //Check it out! 85 86 … … 136 137 { 137 138 Mip mip1; 139 #if LEMON_DEFAULT_MIP==LEMON_CBC_ 140 aTest(mip1, false); 141 #else 138 142 aTest(mip1); 143 #endif 139 144 cloneTest<Mip>(); 140 145 } … … 162 167 { 163 168 CbcMip mip1; 164 aTest(mip1 );169 aTest(mip1, false); 165 170 cloneTest<CbcMip>(); 166 171 }
Note: See TracChangeset
for help on using the changeset viewer.