# HG changeset patch
# User kpeter
# Date 1243875239 0
# Node ID bafe730864daa80c0ec2fa4f4923be964f64736a
# Parent  1f99c95ddd2d2607053cbb28f63bcdf021da7026
Remove a faulty check from lp_test.cc

diff -r 1f99c95ddd2d -r bafe730864da test/lp_test.cc
--- a/test/lp_test.cc	Mon Jun 01 15:37:51 2009 +0000
+++ b/test/lp_test.cc	Mon Jun 01 16:53:59 2009 +0000
@@ -325,7 +325,7 @@
   check(clp->coeff(upright,x1)==1,"The coefficient in question is 1!");
   //  std::cout<<lp.colLowerBound(x1)<<std::endl;
   check(  clp->colLowerBound(x1)==0,"The lower bound for variable x1 should be 0.");
-  std::cerr << clp->colUpperBound(x1) << std::endl;
+  // std::cout << clp->colUpperBound(x1) << std::endl;
   check(  clp->colUpperBound(x1)==LpSolverBase::INF,"The upper bound for variable x1 should be infty.");
 
   clp->getRowBounds(upright,lb,ub);
@@ -357,14 +357,17 @@
   expected_opt=-1;
   solveAndCheck(lp, LpSolverBase::OPTIMAL, expected_opt);
 
+/*
   //Erase one constraint and return to maximization
   lp.eraseRow(upright);
   lp.max();
   expected_opt=LpSolverBase::INF;
   solveAndCheck(lp, LpSolverBase::INFINITE, expected_opt);
+*/
 
   //Infeasibilty
   lp.addRow(x1+x2 <=-2);  
+  lp.max();
   solveAndCheck(lp, LpSolverBase::INFEASIBLE, expected_opt);
 
   //Change problem and forget to solve