#ifdef HAVE_CONFIG_H #include #endif #ifdef HAVE_GLPK #include #elif HAVE_CPLEX #include #endif using namespace lemon; #ifdef HAVE_GLPK typedef LpGlpk LpDefault; #elif HAVE_CPLEX typedef LpCplex LpDefault; #endif void lpTest(LpSolverBase & lp) { typedef LpSolverBase LP; std::vector x(10); // for(int i=0;i<10;i++) x.push_back(lp.addCol()); lp.addColSet(x); std::vector y(10); lp.addColSet(y); std::map z; z.insert(std::make_pair(12,INVALID)); z.insert(std::make_pair(2,INVALID)); z.insert(std::make_pair(7,INVALID)); z.insert(std::make_pair(5,INVALID)); lp.addColSet(z); LP::Expr e,f,g; LP::Col p1,p2,p3,p4,p5; LP::Constr c; e[p1]=2; e.constComp()=12; e[p1]+=2; e.constComp()+=12; e[p1]-=2; e.constComp()-=12; e=2; e=2.2; e=p1; e=f; e+=2; e+=2.2; e+=p1; e+=f; e-=2; e-=2.2; e-=p1; e-=f; e*=2; e*=2.2; e/=2; e/=2.2; e=((p1+p2)+(p1-p2)+(p1+12)+(12+p1)+(p1-12)+(12-p1)+ (f+12)+(12+f)+(p1+f)+(f+p1)+(f+g)+ (f-12)+(12-f)+(p1-f)+(f-p1)+(f-g)+ 2.2*f+f*2.2+f/2.2+ 2*f+f*2+f/2+ 2.2*p1+p1*2.2+p1/2.2+ 2*p1+p1*2+p1/2 ); c = (e <= f ); c = (e <= 2.2); c = (e <= 2 ); c = (e <= p1 ); c = (2.2<= f ); c = (2 <= f ); c = (p1 <= f ); c = (p1 <= p2 ); c = (p1 <= 2.2); c = (p1 <= 2 ); c = (2.2<= p2 ); c = (2 <= p2 ); c = (e >= f ); c = (e >= 2.2); c = (e >= 2 ); c = (e >= p1 ); c = (2.2>= f ); c = (2 >= f ); c = (p1 >= f ); c = (p1 >= p2 ); c = (p1 >= 2.2); c = (p1 >= 2 ); c = (2.2>= p2 ); c = (2 >= p2 ); c = (e == f ); c = (e == 2.2); c = (e == 2 ); c = (e == p1 ); c = (2.2== f ); c = (2 == f ); c = (p1 == f ); //c = (p1 == p2 ); c = (p1 == 2.2); c = (p1 == 2 ); c = (2.2== p2 ); c = (2 == p2 ); c = (2 <= e <= 3); c = (2 <= p1<= 3); c = (2 >= e >= 3); c = (2 >= p1>= 3); e[x[3]]=2; e[x[3]]=4; e[x[3]]=1; e.constComp()=12; lp.addRow(LP::INF,e,23); lp.addRow(LP::INF,3.0*(x[1]+x[2]/2)-x[3],23); lp.addRow(LP::INF,3.0*(x[1]+x[2]*2-5*x[3]+12-x[4]/3)+2*x[4]-4,23); lp.addRow(x[1]+x[3]<=x[5]-3); lp.addRow(-7<=x[1]+x[3]-12<=3); lp.addRow(x[1]<=x[5]); } int main() { LpDefault lp; lpTest(lp); return 0; }