Originally posted by: SystemAdmin

I've been working in a model in IBM ILOG CPLEX Optimization Studio 12.2, but for big instances it gaves me the fail "Warning: MIP starts not constructed because of out-of-memory status." -> CPLEX: Out of memory
Here is the Opl-output, with profiler data:
Bound infeasibility column 'Compositions#128#128'.
Presolve time = 0.06 sec.

Refine conflict on 117614 members...

Iteration Max Members Min Members
1 117500 0
2 117486 0
3 117483 0
4 58742 0
5 55071 0
6 54613 0
7 54499 0
8 54442 0
9 54413 0
10 54399 0
11 54398 0
12 54397 0
13 54396 0
14 54395 0
15 54394 0
16 54393 0
17 54392 0
18 54391 0
19 54390 0
20 54389 0
21 54388 0
22 54387 0
23 54386 0
24 54385 0
25 54384 0
26 54383 0
27 54382 0
28 54381 0
29 54380 0
30 54379 0
31 54378 0
32 54377 0
33 54376 0
34 54375 0
35 54374 0
36 54373 0
37 54372 0
38 54371 0
39 54370 0
40 54369 0
41 54368 0
42 54367 0
43 54366 0
44 54365 0
45 54364 0
46 54363 0
47 54362 0
48 54361 0
49 54360 0
50 54359 0
51 54358 0
52 54357 0
53 54356 0
54 54355 0
55 54354 0
56 54353 0
57 54352 0
58 54351 0
59 54350 0
60 54349 0
61 54348 0
62 54347 0
63 54346 0
64 54345 0
65 54344 0
66 54343 0
67 54342 0
68 54341 0
69 54340 0
70 54339 0
71 54338 0
72 54337 0
73 54336 0
74 54335 0
75 54334 0
76 54333 0
77 54332 0
78 54331 0
79 54330 0
80 54329 0
81 54328 0
82 54327 0
83 54326 0
84 54325 0
85 54324 0
86 54323 0
87 54322 0
88 54321 0
89 54320 0
90 54319 0
91 54318 0
92 54317 0
93 54316 0
94 54315 0
95 54314 0
96 54313 0
97 54312 0
98 54311 0
99 54310 0
100 54309 0
101 54308 0
102 54307 0
103 54306 0
104 54305 0
105 54304 0
106 54303 0
107 54302 0
108 54301 0
109 54300 0
110 54299 0
111 54298 0
112 54297 0
113 54296 0
114 54293 0
115 54292 0
116 54291 0
117 54290 0
118 54289 0
119 54288 0
120 54287 0
121 54286 0
122 54285 0
123 54284 0
124 54283 0
125 54282 0
126 54281 0
127 54280 0
128 54279 0
129 54278 0
130 54277 0
131 54276 0
132 54275 0
133 54274 0
134 54273 0
135 54272 0
136 54271 0
137 54270 0
138 54269 0
139 54268 0
140 54267 0
141 54266 0
142 54265 0
143 54264 0
144 54263 0
145 54262 0
146 54261 0
147 54260 0
148 54259 0
149 54258 0
150 54257 0
151 54256 0
152 54255 0
153 54254 0
154 54253 0
155 54252 0
156 54251 0
157 54250 0
158 54249 0
159 54248 0
160 54247 0
161 54246 0
162 54245 0
163 54244 0
164 54243 0
165 54242 0
166 54241 0
167 54240 0
168 54239 0
169 54238 0
170 54237 0
171 54236 0
172 54235 0
173 54234 0
174 54233 0
175 54232 0
176 54231 0
177 54230 0
178 54229 0
179 54228 0
180 54227 0
181 54226 0
182 54225 0
183 54224 0
184 54223 0
185 54222 0
186 54221 0
187 54220 0
188 54219 0
189 54218 0
190 54217 0
191 54216 0
192 54215 0
193 54214 0
194 54213 0
195 54212 0
196 54211 0
197 54210 0
198 54209 0
199 54208 0
200 54207 0
201 54206 0
202 54205 0
203 54204 0
204 54203 0
205 54202 0
206 54201 0
207 54200 0
208 54199 0
209 54198 0
210 54197 0
211 54196 0
212 54195 0
213 54194 0
214 54193 0
215 54192 0
216 54191 0
217 54190 0
218 54189 0
219 54188 0
220 54187 0
221 54186 0
222 54185 0
223 54184 0
224 54183 0
225 216 0
226 216 1
227 216 2
228 216 3
229 216 4
230 216 5
231 216 6
232 216 7
233 216 8
234 216 9
235 216 10
236 216 11
237 216 12
238 216 13
239 216 14
240 216 15
241 216 16
242 216 17
243 216 18
244 216 19
245 216 20
246 216 21
247 216 22
248 216 23
249 216 24
250 216 25
251 216 26
252 216 27
253 216 28
254 216 29
255 216 30
256 216 31
257 216 32
258 216 33
259 216 34
260 216 35
261 216 36
262 216 37
263 216 38
264 216 39
265 216 40
266 216 41
267 216 42
268 216 43
269 216 44
270 216 45
271 216 46
272 216 47
273 216 48
274 216 49
275 216 50
276 216 51
277 216 52
278 216 53
279 216 54
280 216 55
281 216 56
282 216 57
283 216 58
284 216 59
285 216 60
286 216 61
287 216 62
288 216 63
289 216 64
290 216 65
291 216 66
292 216 67
293 216 68
294 216 69
295 216 70
296 216 71
297 216 72
298 216 73
299 216 74
300 216 75
301 216 76
302 216 77
303 216 78
304 216 79
305 216 80
306 216 81
307 216 82
308 216 83
309 216 84
310 216 85
311 216 86
312 216 87
313 216 88
314 216 89
315 216 90
316 216 91
317 216 92
318 216 93
319 216 94
320 216 95
321 216 96
322 216 97
323 216 98
324 216 99
325 216 100
326 216 101
327 216 102
328 216 103
329 216 104
330 216 105
331 216 106
332 216 107
333 216 108
334 216 109
335 216 110
336 216 111
337 216 112
338 216 113
339 216 114
340 216 115
341 216 116
342 216 117
343 216 118
344 216 119
345 216 120
346 216 121
347 216 122
348 216 123
349 216 124
350 216 125
351 216 126
352 216 127
353 216 128
354 216 129
355 216 130
356 216 131
357 216 132
358 216 133
359 216 134
360 216 135
361 216 136
362 216 137
363 216 138
364 216 139
365 216 140
366 216 141
367 216 142
368 216 143
369 216 144
370 216 145
371 216 146
372 216 147
373 216 148
374 216 149
375 216 150
376 216 151
377 216 152
378 216 153
379 216 154
380 216 155
381 216 156
382 216 157
383 216 158
384 216 159
385 216 160
386 216 161
387 216 162
388 216 163
389 216 164
390 216 165
391 216 166
392 216 167
393 216 168
394 216 169
395 216 170
396 216 171
397 216 172
398 216 173
399 216 174
400 216 175
401 216 176
402 216 177
403 216 178
404 216 179
405 216 180
406 216 181
407 216 182
408 216 183
409 216 184
410 216 185
411 216 186
412 216 187
413 216 188
414 216 189
415 216 190
416 216 191
417 216 192
418 216 193
419 216 194
420 216 195
421 216 196
422 216 197
423 216 198
424 216 199
425 216 200
426 216 201
427 216 202
428 216 203
429 216 204
430 216 205
431 216 206
432 216 207
433 216 208
434 216 209
435 216 210
436 216 211
437 216 212
438 216 213
439 216 214
440 216 215
441 216 216
Tried aggregator 1 time.
MIP Presolve eliminated 176176 rows and 176179 columns.
MIP Presolve modified 2904 coefficients.
Reduced MIP has 59050 rows, 117858 columns, and 352114 nonzeros.
Reduced MIP has 58806 binaries, 0 generals, 0 SOSs, and 0 indicators.
Probing time = 0.20 sec.
Tried aggregator 1 time.
Presolve time = 1.41 sec.
Found feasible solution after 1.55 sec. Objective = 823921.5760
Probing time = 0.28 sec.
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 2 threads.
Root relaxation solution time = 54.45 sec.

Nodes Cuts/
Node Left Objective IInf Best Integer Best Node ItCnt

Gap

• 0+ 0 823921.5760 51150 -

• 0+ 0 673.0000 51150 -

0 0 400.7666 2727 673.0000 400.7666 51150

40.45%
0 0 403.2586 2596 673.0000 Cuts: 44 52784

40.08%
0 0 434.3108 1896 673.0000 Cuts: 194 57515

35.47%
0 0 434.3108 1897 673.0000 Flowcuts: 1 57519

35.47%

• 0+ 0 628.4280 434.3108 57519

30.89%

• 0+ 0 621.0000 434.3108 57519

30.06%

• 0+ 0 618.0000 434.3108 57519

29.72%
0 2 434.3108 1897 618.0000 434.3108 57519

29.72%
Elapsed real time = 75.11 sec. (tree size = 0.01 MB)
4 6 434.9820 1904 618.0000 434.3547 57771

29.72%
16 18 435.0412 1881 618.0000 434.4209 58713

29.71%
20 22 435.4352 1888 618.0000 434.4209 59420

29.71%
32 34 435.8000 1880 618.0000 434.4209 60377

29.71%
39 41 436.5974 1874 618.0000 434.4209 60492

29.71%
52 54 436.4405 1863 618.0000 434.4209 60696

29.71%
62 64 436.6122 1861 618.0000 434.4209 61118

29.71%
74 76 437.3363 1859 618.0000 434.4209 61856

29.71%
80 82 437.3964 1865 618.0000 434.4209 62396

29.71%
122 124 439.1796 1858 618.0000 434.4209 65281

29.71%
Elapsed real time = 93.73 sec. (tree size = 8.91 MB)
157 159 442.2939 1827 618.0000 434.4209 68690

29.71%
186 188 446.3511 1814 618.0000 434.4209 72254

29.71%
224 226 450.5748 1805 618.0000 434.4209 75426

29.71%
264 266 456.6919 1751 618.0000 434.4209 78702

29.71%
300 302 463.2983 1707 618.0000 434.4209 80771

29.71%
351 353 470.4893 1669 618.0000 434.4209 82555

29.71%
372 374 473.3712 1647 618.0000 434.4209 83036

29.71%

• 416+ 416 617.0000 434.4209 83548

29.59%
456 458 481.4044 1600 617.0000 434.4209 83842

29.59%
514 516 591.7176 619 617.0000 591.7176 198292

4.10%
517 519 592.4223 585 617.0000 591.8465 199088

4.08%
Elapsed real time = 765.92 sec. (tree size = 40.28 MB)
521 521 592.6756 584 617.0000 591.8928 200739

4.07%
523 523 592.8881 802 617.0000 591.8928 202761

4.07%
525 525 592.8190 826 617.0000 591.8928 205132

4.07%
528 527 592.9690 913 617.0000 591.8928 216412

4.07%
529 528 592.2161 557 617.0000 591.8928 216576

4.07%
539 533 593.4866 978 617.0000 591.8928 223844

4.07%
553 538 593.5805 627 617.0000 591.8928 226910

4.07%
572 549 593.4225 633 617.0000 591.8928 229618

4.07%
577 551 593.7207 611 617.0000 591.8928 231108

4.07%
585 555 593.7583 615 617.0000 591.8928 232553

4.07%
Elapsed real time = 870.72 sec. (tree size = 53.29 MB)
606 566 593.5304 533 617.0000 591.8928 234595

4.07%
616 570 593.8362 902 617.0000 591.8928 239998

4.07%
625 573 593.9946 788 617.0000 591.8928 245707

4.07%
641 582 593.9491 518 617.0000 591.8928 248809

4.07%
658 592 594.5227 516 617.0000 591.8928 250626

4.07%
663 594 593.8291 694 617.0000 591.8928 252584

4.07%
667 597 593.9576 509 617.0000 591.8928 253428

4.07%
694 613 595.0110 476 617.0000 591.8928 255992

4.07%
702 617 594.2083 458 617.0000 591.8928 258511

4.07%
704 618 594.2083 768 617.0000 591.8928 261635

4.07%
Elapsed real time = 930.75 sec. (tree size = 132.55 MB)
717 625 593.8941 732 617.0000 591.8928 267660

4.07%
728 631 594.2746 433 617.0000 591.8928 271220

4.07%
737 636 594.1144 520 617.0000 591.8928 273493

4.07%
745 641 594.1810 509 617.0000 591.8928 274531

4.07%
769 657 594.2726 503 617.0000 591.8928 276335

4.07%
785 666 594.2770 507 617.0000 591.8928 278388

4.07%
795 671 594.2814 493 617.0000 591.8928 279228

4.07%
808 679 594.2943 542 617.0000 591.8928 281216

4.07%
820 686 594.3040 519 617.0000 591.8928 282113

4.07%
840 693 594.9020 564 617.0000 591.8928 283768

4.07%
Elapsed real time = 976.70 sec. (tree size = 218.60 MB)
Nodefile size = 38.57 MB (16.93 MB after compression)
852 701 594.6323 464 617.0000 591.8928 287493

4.07%
862 704 595.7183 577 617.0000 591.8928 290815

4.07%
870 708 594.8285 478 617.0000 591.8928 291983

4.07%
882 712 595.5718 501 617.0000 591.8928 294662

4.07%
899 720 595.3979 549 617.0000 591.8928 299403

4.07%
902 722 595.4437 570 617.0000 591.8928 302073

4.07%
921 729 595.2298 452 617.0000 591.8928 306455

4.07%
936 739 594.9917 463 617.0000 591.8928 307821

4.07%
959 754 595.3484 518 617.0000 591.8928 309267

4.07%
965 758 594.9954 521 617.0000 591.8928 311313

4.07%
Elapsed real time = 1019.48 sec. (tree size = 307.79 MB)
Nodefile size = 136.13 MB (60.17 MB after compression)
985 765 595.0006 443 617.0000 591.8928 313846

4.07%
987 766 595.0024 488 617.0000 591.8928 314689

4.07%
1005 774 595.0024 476 617.0000 591.8928 316622

4.07%
1013 780 595.0144 508 617.0000 591.8928 319933

4.07%
1015 781 595.4950 506 617.0000 591.8928 323653

4.07%
1036 794 595.5903 526 617.0000 591.8928 331103

4.07%
1038 795 595.3848 519 617.0000 591.8928 333426

4.07%
1040 796 595.3848 548 617.0000 591.8928 335776

4.07%
1054 804 595.6179 556 617.0000 591.8928 342397

4.07%
1062 809 595.6240 554 617.0000 591.8928 345271

4.07%
Elapsed real time = 1072.73 sec. (tree size = 375.56 MB)
Nodefile size = 209.69 MB (92.95 MB after compression)
1067 812 595.6098 617 617.0000 591.8928 349968

4.07%
1086 826 596.0531 531 617.0000 591.8928 353968

4.07%
1090 829 595.6657 463 617.0000 591.8928 357899

4.07%
1099 834 595.7545 499 617.0000 591.8928 359943

4.07%
1108 839 596.0895 575 617.0000 591.8928 363346

4.07%
1129 855 595.7177 377 617.0000 591.8928 364914

4.07%
1145 865 596.2151 342 617.0000 591.8928 366329

4.07%
1152 871 596.9415 736 617.0000 591.8928 373119

4.07%
1160 876 596.4526 568 617.0000 591.8928 379828

4.07%
1164 880 596.4912 723 617.0000 591.8928 388566

4.07%
Elapsed real time = 1142.14 sec. (tree size = 448.25 MB)
Nodefile size = 289.10 MB (128.72 MB after compression)
1190 894 597.0056 534 617.0000 591.8928 398844

4.07%
1196 897 596.5206 729 617.0000 591.8928 400823

4.07%
1198 898 596.5562 702 617.0000 591.8928 403397

4.07%
1199 899 596.3458 519 617.0000 591.8928 405635

4.07%
1201 900 596.6953 491 617.0000 591.8928 407076

4.07%
1212 907 596.5683 729 617.0000 591.8928 411394

4.07%
1214 908 597.3417 732 617.0000 591.8928 413344

4.07%
1230 916 596.5757 608 617.0000 591.8928 415043

4.07%
1236 918 597.5012 629 617.0000 591.8928 416874

4.07%
1260 932 596.3661 395 617.0000 591.8928 424854

4.07%
Elapsed real time = 1185.98 sec. (tree size = 516.88 MB)
Nodefile size = 359.06 MB (160.64 MB after compression)
1276 942 596.4075 448 617.0000 591.8928 426623

4.07%
1278 942 597.2082 465 617.0000 591.8928 428663

4.07%
1290 950 597.3399 523 617.0000 591.8928 430160

4.07%

• 1298+ 896 616.0000 591.8928 430281

3.91%
1306 902 596.7577 524 616.0000 591.8928 434363

3.91%
1331 916 596.4154 468 616.0000 591.8928 441814

3.91%
1347 925 596.9914 531 616.0000 591.8928 445836

3.91%
1375 938 597.0630 425 616.0000 591.8928 450347

3.91%
1377 939 596.5326 466 616.0000 591.8928 451466

3.91%
1379 939 596.9741 546 616.0000 591.8928 452886

3.91%
1409 959 597.7208 636 616.0000 591.8928 464216

3.91%
Elapsed real time = 1249.41 sec. (tree size = 606.51 MB)
Nodefile size = 453.10 MB (203.82 MB after compression)
1418 965 596.6132 516 616.0000 591.8928 471094

3.91%
1444 978 596.9118 527 616.0000 591.8928 483837

3.91%
1472 992 597.2323 572 616.0000 591.8928 494610

3.91%
1502 1010 597.3153 573 616.0000 591.8928 502830

3.91%
1515 1018 597.4725 586 616.0000 591.8928 514864

3.91%
1534 1029 596.8382 471 616.0000 591.8928 522019

3.91%
1566 1054 598.0563 397 616.0000 591.8928 532414

3.91%
1597 1085 597.7261 523 616.0000 591.8928 541621

3.91%
1631 1119 596.9642 520 616.0000 591.8928 553109

3.91%
1642 1129 597.1907 555 616.0000 591.8928 560646

3.91%
Elapsed real time = 1396.47 sec. (tree size = 766.48 MB)
Nodefile size = 611.39 MB (277.45 MB after compression)

There may be further error information in the clone logs.

Cover cuts applied: 25
Mixed integer rounding cuts applied: 667
Zero-half cuts applied: 348
Gomory fractional cuts applied: 326

Root node processing (before b&c):
Real time = 73.56
Parallel b&c, 2 threads:
Real time = 1343.92
Sync time (average) = 19.20
Wait time (average) = 65.23

---

Total (root+branch&cut) = 1417.48 sec.
Warning: MIP starts not constructed because of out-of-memory status.
---------------------->
attached the lp file as well as log file.
#CPLEXOptimizers
#DecisionOptimization

Originally posted by: SystemAdmin

Your problem is infeasible and therefore OPL starts the conflict refiner and something else (probably feasopt). Is that expected or should your model be feasible?
In case this is expected, you can safely ignore the "MIP starts not constructed ..." message. It only means that there was not enough memory to store MIP starts and the next attempt to solve the exact same problem will not hot-start from the last solution found.
#CPLEXOptimizers
#DecisionOptimization

Originally posted by: SystemAdmin

Thx~~~,i think this would be the clue.
In fact, my model has a original form of CP, considering K as a dvar:
------------------------------CP MODEL----------------------------
using CP;
//TAZ影响区个数；
int infCount=...;
//最大TAZ个数(TAZ中心点个数)；
int maxTAZNum=...;
//最小TAZ个数(TAZ中心点个数)；
int minTAZNum=...;
//TAZ索引范围（TAZ中心点取值范围，TAZ个数取值范围）；
range ithCenInf=1..infCount;
//TAZ影响区索引(TAZ影响区个数取值范围)；
range jthInf=1..infCount;
//各个影响区的需求
int DemandjthInf=...;
//影响区j到TAZi中心影响区的距离；
float DistanceithCenInfjthInf=...;
float Sum2LD=...;
float LocalDepthjthInf=...;
int ComPoolithCenInfjthInf=...;
//int K=50;
dvar int CompositionsithCenInfjthInf in 0..1;
dvar int CenInfsithCenInf in 0..1;
dvar int K in minTAZNum..maxTAZNum;

execute{
writeln("LDC",0.7*(Sum2LD/50));
}
minimize
sum(i in ithCenInf, j in jthInf) Compositions[i][j]*Distance[i][j]*Demand[j];

subject to {
ct1:
sum(i in ithCenInf, j in jthInf) Compositions[i][j]==infCount;
ct2:
sum(i in ithCenInf) CenInfs[i]==K;
ct3:
forall(j in jthInf)
sum (i in ithCenInf) Compositions[i][j]<=1;
ct4:
forall(i in ithCenInf, j in jthInf)
{
Compositions[i][j]<=ComPool[i][j];
Compositions[i][j]<=CenInfs[i];
}
ct5:
forall(i in ithCenInf)
sum(j in jthInf) LocalDepth[j]*Compositions[i][j]>=0.7*(Sum2LD/K);

}

---

Running this version, opl responses :Problem found infeasible at the root node .
!

---

! Minimization problem - 58,807 variables, 117,614 constraints
! Problem found infeasible at the root node
!

---

! Solution status : Terminated normally, model has no solution
! Number of branches : 0
! Number of fails : 1
! Total memory usage : 181.5 Mb (164.9 Mb CP Optimizer + 16.5 Mb Concert)
! Time spent in solve : 0.64s (0.64s engine + 0.00s extraction)
! Search speed (br. / s) : 0
!

---

---

After that, i got in trouble because i connot figure out why my model is infeasible.
So, is there any way to cure or debug a infeasible model?
#CPLEXOptimizers
#DecisionOptimization

Originally posted by: SystemAdmin

Handling infeasibility is explained in the user manual. Can you please take a look at this chapter and get back here if that does not help?
#CPLEXOptimizers
#DecisionOptimization

Originally posted by: SystemAdmin

eh~~~,feel so tired to learn it. Well, worth to try. Thank you very much~. ^_^~~
#CPLEXOptimizers
#DecisionOptimization

Originally posted by: SystemAdmin

问题解决了。
是约束：
forall(i in Infs)
sum(j in Infs) LocalDepth[j]*Compositions[i][j]>=0.7*(Sum2LD/K);
错误，应该改成：
forall(i in Infs)
sum(j in Infs) LocalDepth[j]*Compositions[i][j]>=0.7*(Sum2LD/K)*CenInfs[i];
#CPLEXOptimizers
#DecisionOptimization

Originally posted by: SystemAdmin

Attache my .mod and .data.
Maybe you can test on your own,if you are available。
#CPLEXOptimizers
#DecisionOptimization

Originally posted by: SystemAdmin

I think :there is a trivial solution with K=1 but not like the situation in opl output.
#CPLEXOptimizers
#DecisionOptimization