| author | ladanyi |
| Sun, 24 Apr 2005 22:26:37 +0000 | |
| changeset 1385 | 49d1ca28ebd8 |
| parent 1309 | b3ce42a4d7d2 |
| child 1387 | 37d1b20cd9ef |
| permissions | -rw-r--r-- |
1 #include<lemon/lp_skeleton.h>
2 #include<lemon/lp_glpk.h>
4 using namespace lemon;
6 void lpTest(LpSolverBase & lp)
7 {
8 typedef LpSolverBase LP;
10 std::vector<LP::Col> x(10);
11 // for(int i=0;i<10;i++) x.push_back(lp.addCol());
12 lp.addColSet(x);
14 std::vector<LP::Col> y(10);
15 lp.addColSet(y);
17 std::map<int,LP::Col> z;
19 z.insert(std::make_pair(12,INVALID));
20 z.insert(std::make_pair(2,INVALID));
21 z.insert(std::make_pair(7,INVALID));
22 z.insert(std::make_pair(5,INVALID));
24 lp.addColSet(z);
27 LP::Expr e,f,g;
28 LP::Col p1,p2,p3,p4,p5;
29 LP::Constr c;
31 e[p1]=2;
32 e.constComp()=12;
33 e[p1]+=2;
34 e.constComp()+=12;
35 e[p1]-=2;
36 e.constComp()-=12;
38 e=2;
39 e=2.2;
40 e=p1;
41 e=f;
43 e+=2;
44 e+=2.2;
45 e+=p1;
46 e+=f;
48 e-=2;
49 e-=2.2;
50 e-=p1;
51 e-=f;
53 e*=2;
54 e*=2.2;
55 e/=2;
56 e/=2.2;
58 e=((p1+p2)+(p1-p2)+(p1+12)+(12+p1)+(p1-12)+(12-p1)+
59 (f+12)+(12+f)+(p1+f)+(f+p1)+(f+g)+
60 (f-12)+(12-f)+(p1-f)+(f-p1)+(f-g)+
61 2.2*f+f*2.2+f/2.2+
62 2*f+f*2+f/2+
63 2.2*p1+p1*2.2+p1/2.2+
64 2*p1+p1*2+p1/2
65 );
68 c = (e <= f );
69 c = (e <= 2.2);
70 c = (e <= 2 );
71 c = (e <= p1 );
72 c = (2.2<= f );
73 c = (2 <= f );
74 c = (p1 <= f );
75 c = (p1 <= p2 );
76 c = (p1 <= 2.2);
77 c = (p1 <= 2 );
78 c = (2.2<= p2 );
79 c = (2 <= p2 );
81 c = (e >= f );
82 c = (e >= 2.2);
83 c = (e >= 2 );
84 c = (e >= p1 );
85 c = (2.2>= f );
86 c = (2 >= f );
87 c = (p1 >= f );
88 c = (p1 >= p2 );
89 c = (p1 >= 2.2);
90 c = (p1 >= 2 );
91 c = (2.2>= p2 );
92 c = (2 >= p2 );
94 c = (e == f );
95 c = (e == 2.2);
96 c = (e == 2 );
97 c = (e == p1 );
98 c = (2.2== f );
99 c = (2 == f );
100 c = (p1 == f );
101 //c = (p1 == p2 );
102 c = (p1 == 2.2);
103 c = (p1 == 2 );
104 c = (2.2== p2 );
105 c = (2 == p2 );
107 c = (2 <= e <= 3);
108 c = (2 <= p1<= 3);
110 c = (2 >= e >= 3);
111 c = (2 >= p1>= 3);
113 e[x[3]]=2;
114 e[x[3]]=4;
115 e[x[3]]=1;
116 e.constComp()=12;
118 lp.addRow(LP::INF,e,23);
119 lp.addRow(LP::INF,3.0*(x[1]+x[2]/2)-x[3],23);
120 lp.addRow(LP::INF,3.0*(x[1]+x[2]*2-5*x[3]+12-x[4]/3)+2*x[4]-4,23);
122 lp.addRow(x[1]+x[3]<=x[5]-3);
123 lp.addRow(-7<=x[1]+x[3]-12<=3);
124 lp.addRow(x[1]<=x[5]);
128 }
130 int main()
131 {
132 LpSkeleton lp_skel;
133 LpGlpk lp_glpk;
135 lpTest(lp_skel);
136 lpTest(lp_glpk);
138 return 0;
139 }