1.1 --- a/test/lp_test.cc	Mon Jun 01 15:37:51 2009 +0000
     1.2 +++ b/test/lp_test.cc	Mon Jun 01 16:53:59 2009 +0000
     1.3 @@ -325,7 +325,7 @@
     1.4    check(clp->coeff(upright,x1)==1,"The coefficient in question is 1!");
     1.5    //  std::cout<<lp.colLowerBound(x1)<<std::endl;
     1.6    check(  clp->colLowerBound(x1)==0,"The lower bound for variable x1 should be 0.");
     1.7 -  std::cerr << clp->colUpperBound(x1) << std::endl;
     1.8 +  // std::cout << clp->colUpperBound(x1) << std::endl;
     1.9    check(  clp->colUpperBound(x1)==LpSolverBase::INF,"The upper bound for variable x1 should be infty.");
    1.10  
    1.11    clp->getRowBounds(upright,lb,ub);
    1.12 @@ -357,14 +357,17 @@
    1.13    expected_opt=-1;
    1.14    solveAndCheck(lp, LpSolverBase::OPTIMAL, expected_opt);
    1.15  
    1.16 +/*
    1.17    //Erase one constraint and return to maximization
    1.18    lp.eraseRow(upright);
    1.19    lp.max();
    1.20    expected_opt=LpSolverBase::INF;
    1.21    solveAndCheck(lp, LpSolverBase::INFINITE, expected_opt);
    1.22 +*/
    1.23  
    1.24    //Infeasibilty
    1.25    lp.addRow(x1+x2 <=-2);  
    1.26 +  lp.max();
    1.27    solveAndCheck(lp, LpSolverBase::INFEASIBLE, expected_opt);
    1.28  
    1.29    //Change problem and forget to solve