-
Notifications
You must be signed in to change notification settings - Fork 0
/
transaction_with_proof_size_2.lst
2000 lines (1314 loc) · 86.4 KB
/
transaction_with_proof_size_2.lst
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 1
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
C o m p i l a t i o n
1
2 Set
3 n 'nodes',
4 Arcs( n, n ) 'Set of arcs in the network'
5 ;
6
7 Alias
8 ( n, i, j, k );
9
10 Parameter
11 proof_size(n),
12 supply(n)
13 ;
14
15
16 Scalar Source 'The Source of the transaction' /5/;
17
18 Scalar Destination 'The destination of the transaction' /-5/;
19
INCLUDE /home/nouroudine/Documents/Spring_2019/Optimization/research_implementation/nodes_2.inc
21
22 Set n /n1*n15/;
23 Set s /a1/;
24
25 Parameter fcost(i, j) /
27 n1 n2 50
28 n2 n1 50
29 n1 n3 50
30 n3 n1 50
31 n1 n4 50
32 n4 n1 50
33 n2 n5 50
34 n5 n2 50
35 n2 n6 50
36 n6 n2 50
37 n3 n7 50
38 n7 n3 50
39 n4 n7 50
40 n7 n4 50
41 n4 n8 50
42 n8 n4 50
43 n5 n6 50
44 n6 n5 50
45 n5 n9 50
46 n9 n5 50
47 n6 n11 50
48 n11 n6 50
49 n6 n10 50
50 n10 n6 50
51 n7 n12 50
52 n12 n7 50
53 n8 n13 50
54 n13 n8 50
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 2
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
C o m p i l a t i o n
55 n9 n12 50
56 n12 n9 50
57 n10 n13 50
58 n13 n10 50
59 n11 n14 50
60 n14 n11 50
61 n11 n15 50
62 n15 n11 50
63 n12 n14 50
64 n14 n12 50
65 n13 n14 50
66 n14 n13 50
67 n14 n15 50
68 n15 n14 50
70 /;
71
72 Parameter
73 proof_size(n);
74
75 Parameter supply(n) /
76
77 n1 1
78 n2 0
79 n3 0
80 n4 0
81 n5 0
82 n6 0
83 n7 0
84 n8 0
85 n9 0
86 n10 0
87 n11 0
88 n12 0
89 n13 0
90 n14 0
91 n15 -1
92
93 /;
94
95 Arcs( i, j ) = no;
96 Arcs( i, j ) = yes$( fcost( i, j ) Gt 0 );
97
98 proof_size( n ) = Uniformint( 1, 100 )$( Supply( n ) Lt 1 )
99
100 Binary Variable
101 path( n, n );
102
103 Free Variable
104 CCPT 'Communication Cost Per Transaction'
105 ;
106
107 Equations
108 Objective,
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 3
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
C o m p i l a t i o n
109 Balance(i)
110 ;
111
112 Objective.. CCPT =e= sum(( i,j )$( Arcs( i, j )), fcost(i ,j) * path( i, j) * proof_size( i ));
113
114 Balance( i ).. sum(j$(Arcs( i, j )), path( i, j ) ) - sum(k$(Arcs(k, i)), path(k,i) ) =e= supply( i );
115
116 Model
117 Shard /all/;
118
119 Solve Shard using mip minimizing CCPT;
120
121 Supply( i ) = 0;
122
123 Display
124 proof_size;
125
126 Display
127 fcost;
128
129 Set
130 iter / iter1*iter15 /
131 ;
132
133 Loop( iter,
134
135 Supply(i)$ord(i) = Source = 5;
136 Supply(i)$ord(i) = Destination = -5;
137
138 Solve Shard using mip minimizing CCPT;
139
140 * Display Supply;
141
142 );
143
144
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 4
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
Include File Summary
SEQ GLOBAL TYPE PARENT LOCAL FILENAME
1 1 INPUT 0 0 /home/nouroudine/Documents/Spring_2019/Optimization/research_implementation/transaction_with_proof_size_2.gms
2 20 INCLUDE 1 20 ./home/nouroudine/Documents/Spring_2019/Optimization/research_implementation/nodes_2.inc
COMPILATION TIME = 0.001 SECONDS 3 MB 25.1.3 r4e34d435fbd LEX-LEG
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 5
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
Equation Listing SOLVE Shard Using MIP From line 119
---- Objective =E=
Objective.. - 900*path(n2,n1) - 900*path(n2,n5) - 900*path(n2,n6) - 4250*path(n3,n1) - 4250*path(n3,n7) - 2800*path(n4,n1) - 2800*path(n4,n7) - 2800*path(n4,n8) - 1550*path(n5,n2) - 1550*path(n5,n6) - 1550*path(n5,n9) - 1500*path(n6,n2)
- 1500*path(n6,n5) - 1500*path(n6,n10) - 1500*path(n6,n11) - 1150*path(n7,n3) - 1150*path(n7,n4) - 1150*path(n7,n12) - 1750*path(n8,n4) - 1750*path(n8,n13) - 4300*path(n9,n5) - 4300*path(n9,n12) - 350*path(n10,n6) - 350*path(n10,n13)
- 2550*path(n11,n6) - 2550*path(n11,n14) - 2550*path(n11,n15) - 5000*path(n12,n7) - 5000*path(n12,n9) - 5000*path(n12,n14) - 2900*path(n13,n8) - 2900*path(n13,n10) - 2900*path(n13,n14) - 5000*path(n14,n11) - 5000*path(n14,n12) - 5000*path(n14,n13)
- 5000*path(n14,n15) - 3850*path(n15,n11) - 3850*path(n15,n14) + CCPT =E= 0 ; (LHS = 0)
---- Balance =E=
Balance(n1).. path(n1,n2) + path(n1,n3) + path(n1,n4) - path(n2,n1) - path(n3,n1) - path(n4,n1) =E= 1 ; (LHS = 0, INFES = 1 ****)
Balance(n2).. - path(n1,n2) + path(n2,n1) + path(n2,n5) + path(n2,n6) - path(n5,n2) - path(n6,n2) =E= 0 ; (LHS = 0)
Balance(n3).. - path(n1,n3) + path(n3,n1) + path(n3,n7) - path(n7,n3) =E= 0 ; (LHS = 0)
REMAINING 12 ENTRIES SKIPPED
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 6
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
Column Listing SOLVE Shard Using MIP From line 119
---- path
path(n1,n2)
(.LO, .L, .UP, .M = 0, 0, 1, 0)
1 Balance(n1)
-1 Balance(n2)
path(n1,n3)
(.LO, .L, .UP, .M = 0, 0, 1, 0)
1 Balance(n1)
-1 Balance(n3)
path(n1,n4)
(.LO, .L, .UP, .M = 0, 0, 1, 0)
1 Balance(n1)
-1 Balance(n4)
REMAINING 39 ENTRIES SKIPPED
---- CCPT Communication Cost Per Transaction
CCPT
(.LO, .L, .UP, .M = -INF, 0, +INF, 0)
1 Objective
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 7
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
Model Statistics SOLVE Shard Using MIP From line 119
MODEL STATISTICS
BLOCKS OF EQUATIONS 2 SINGLE EQUATIONS 16
BLOCKS OF VARIABLES 2 SINGLE VARIABLES 43
NON ZERO ELEMENTS 124 DISCRETE VARIABLES 42
GENERATION TIME = 0.003 SECONDS 4 MB 25.1.3 r4e34d435fbd LEX-LEG
EXECUTION TIME = 0.004 SECONDS 4 MB 25.1.3 r4e34d435fbd LEX-LEG
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 8
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
Solution Report SOLVE Shard Using MIP From line 119
S O L V E S U M M A R Y
MODEL Shard OBJECTIVE CCPT
TYPE MIP DIRECTION MINIMIZE
SOLVER CPLEX FROM LINE 119
**** SOLVER STATUS 1 Normal Completion
**** MODEL STATUS 1 Optimal
**** OBJECTIVE VALUE 4950.0000
RESOURCE USAGE, LIMIT 0.008 1000.000
ITERATION COUNT, LIMIT 3 2000000000
IBM ILOG CPLEX 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEG x86 64bit/Linux
Cplex 12.8.0.0
Space for names approximately 0.00 Mb
Use option 'names no' to turn use of names off
MIP status(101): integer optimal solution
Cplex Time: 0.00sec (det. 0.42 ticks)
Fixing integer variables, and solving final LP...
Fixed MIP status(1): optimal
Cplex Time: 0.00sec (det. 0.02 ticks)
Proven optimal solution.
MIP Solution: 4950.000000 (3 iterations, 0 nodes)
Final Solve: 4950.000000 (0 iterations)
Best possible: 4950.000000
Absolute gap: 0.000000
Relative gap: 0.000000
LOWER LEVEL UPPER MARGINAL
---- EQU Objective . . . 1.0000
---- EQU Balance
LOWER LEVEL UPPER MARGINAL
n1 1.0000 1.0000 1.0000 .
n2 . . . .
n3 . . . .
n4 . . . .
n5 . . . .
n6 . . . .
n7 . . . .
n8 . . . .
n9 . . . .
n10 . . . .
n11 . . . .
n12 . . . .
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 9
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
Solution Report SOLVE Shard Using MIP From line 119
EQU Balance
LOWER LEVEL UPPER MARGINAL
n13 . . . .
n14 . . . .
n15 -1.0000 -1.0000 -1.0000 .
---- VAR path
LOWER LEVEL UPPER MARGINAL
n1 .n2 . 1.0000 1.0000 EPS
n1 .n3 . . 1.0000 EPS
n1 .n4 . . 1.0000 EPS
n2 .n1 . . 1.0000 900.0000
n2 .n5 . . 1.0000 900.0000
n2 .n6 . 1.0000 1.0000 900.0000
n3 .n1 . . 1.0000 4250.0000
n3 .n7 . . 1.0000 4250.0000
n4 .n1 . . 1.0000 2800.0000
n4 .n7 . . 1.0000 2800.0000
n4 .n8 . . 1.0000 2800.0000
n5 .n2 . . 1.0000 1550.0000
n5 .n6 . . 1.0000 1550.0000
n5 .n9 . . 1.0000 1550.0000
n6 .n2 . . 1.0000 1500.0000
n6 .n5 . . 1.0000 1500.0000
n6 .n10 . . 1.0000 1500.0000
n6 .n11 . 1.0000 1.0000 1500.0000
n7 .n3 . . 1.0000 1150.0000
n7 .n4 . . 1.0000 1150.0000
n7 .n12 . . 1.0000 1150.0000
n8 .n4 . . 1.0000 1750.0000
n8 .n13 . . 1.0000 1750.0000
n9 .n5 . . 1.0000 4300.0000
n9 .n12 . . 1.0000 4300.0000
n10.n6 . . 1.0000 350.0000
n10.n13 . . 1.0000 350.0000
n11.n6 . . 1.0000 2550.0000
n11.n14 . . 1.0000 2550.0000
n11.n15 . 1.0000 1.0000 2550.0000
n12.n7 . . 1.0000 5000.0000
n12.n9 . . 1.0000 5000.0000
n12.n14 . . 1.0000 5000.0000
n13.n8 . . 1.0000 2900.0000
n13.n10 . . 1.0000 2900.0000
n13.n14 . . 1.0000 2900.0000
n14.n11 . . 1.0000 5000.0000
n14.n12 . . 1.0000 5000.0000
n14.n13 . . 1.0000 5000.0000
n14.n15 . . 1.0000 5000.0000
n15.n11 . . 1.0000 3850.0000
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 10
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
Solution Report SOLVE Shard Using MIP From line 119
VAR path
LOWER LEVEL UPPER MARGINAL
n15.n14 . . 1.0000 3850.0000
LOWER LEVEL UPPER MARGINAL
---- VAR CCPT -INF 4950.0000 +INF .
CCPT Communication Cost Per Transaction
**** REPORT SUMMARY : 0 NONOPT
0 INFEASIBLE
0 UNBOUNDED
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 11
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
E x e c u t i o n
---- 124 PARAMETER proof_size
n2 18.000, n3 85.000, n4 56.000, n5 31.000, n6 30.000, n7 23.000, n8 35.000, n9 86.000, n10 7.000, n11 51.000, n12 100.000, n13 58.000, n14 100.000, n15 77.000
---- 127 PARAMETER fcost
n1 n2 n3 n4 n5 n6 n7 n8 n9 n10 n11 n12 n13 n14 n15
n1 50.000 50.000 50.000
n2 50.000 50.000 50.000
n3 50.000 50.000
n4 50.000 50.000 50.000
n5 50.000 50.000 50.000
n6 50.000 50.000 50.000 50.000
n7 50.000 50.000 50.000
n8 50.000 50.000
n9 50.000 50.000
n10 50.000 50.000
n11 50.000 50.000 50.000
n12 50.000 50.000 50.000
n13 50.000 50.000 50.000
n14 50.000 50.000 50.000 50.000
n15 50.000 50.000
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 12
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
Equation Listing SOLVE Shard Using MIP From line 138
---- Objective =E=
Objective.. - 900*path(n2,n1) - 900*path(n2,n5) - 900*path(n2,n6) - 4250*path(n3,n1) - 4250*path(n3,n7) - 2800*path(n4,n1) - 2800*path(n4,n7) - 2800*path(n4,n8) - 1550*path(n5,n2) - 1550*path(n5,n6) - 1550*path(n5,n9) - 1500*path(n6,n2)
- 1500*path(n6,n5) - 1500*path(n6,n10) - 1500*path(n6,n11) - 1150*path(n7,n3) - 1150*path(n7,n4) - 1150*path(n7,n12) - 1750*path(n8,n4) - 1750*path(n8,n13) - 4300*path(n9,n5) - 4300*path(n9,n12) - 350*path(n10,n6) - 350*path(n10,n13)
- 2550*path(n11,n6) - 2550*path(n11,n14) - 2550*path(n11,n15) - 5000*path(n12,n7) - 5000*path(n12,n9) - 5000*path(n12,n14) - 2900*path(n13,n8) - 2900*path(n13,n10) - 2900*path(n13,n14) - 5000*path(n14,n11) - 5000*path(n14,n12) - 5000*path(n14,n13)
- 5000*path(n14,n15) - 3850*path(n15,n11) - 3850*path(n15,n14) + CCPT =E= 0 ; (LHS = 0)
---- Balance =E=
Balance(n1).. path(n1,n2) + path(n1,n3) + path(n1,n4) - path(n2,n1) - path(n3,n1) - path(n4,n1) =E= 1 ; (LHS = 1)
Balance(n2).. - path(n1,n2) + path(n2,n1) + path(n2,n5) + path(n2,n6) - path(n5,n2) - path(n6,n2) =E= 1 ; (LHS = 0, INFES = 1 ****)
Balance(n3).. - path(n1,n3) + path(n3,n1) + path(n3,n7) - path(n7,n3) =E= 1 ; (LHS = 0, INFES = 1 ****)
REMAINING 12 ENTRIES SKIPPED
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 13
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
Column Listing SOLVE Shard Using MIP From line 138
---- path
path(n1,n2)
(.LO, .L, .UP, .M = 0, 1, 1, EPS)
1 Balance(n1)
-1 Balance(n2)
path(n1,n3)
(.LO, .L, .UP, .M = 0, 0, 1, EPS)
1 Balance(n1)
-1 Balance(n3)
path(n1,n4)
(.LO, .L, .UP, .M = 0, 0, 1, EPS)
1 Balance(n1)
-1 Balance(n4)
REMAINING 39 ENTRIES SKIPPED
---- CCPT Communication Cost Per Transaction
CCPT
(.LO, .L, .UP, .M = -INF, 4950, +INF, 0)
1 Objective
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 14
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
Model Statistics SOLVE Shard Using MIP From line 138
LOOPS iter iter1
MODEL STATISTICS
BLOCKS OF EQUATIONS 2 SINGLE EQUATIONS 16
BLOCKS OF VARIABLES 2 SINGLE VARIABLES 43
NON ZERO ELEMENTS 124 DISCRETE VARIABLES 42
GENERATION TIME = 0.003 SECONDS 3 MB 25.1.3 r4e34d435fbd LEX-LEG
EXECUTION TIME = 0.004 SECONDS 3 MB 25.1.3 r4e34d435fbd LEX-LEG
L O O P S iter iter1
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 15
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
Solution Report SOLVE Shard Using MIP From line 138
S O L V E S U M M A R Y
MODEL Shard OBJECTIVE CCPT
TYPE MIP DIRECTION MINIMIZE
SOLVER CPLEX FROM LINE 138
**** SOLVER STATUS 1 Normal Completion
**** MODEL STATUS 10 Integer Infeasible
**** OBJECTIVE VALUE NA
RESOURCE USAGE, LIMIT 0.006 1000.000
ITERATION COUNT, LIMIT 0 2000000000
IBM ILOG CPLEX 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEG x86 64bit/Linux
Cplex 12.8.0.0
Space for names approximately 0.00 Mb
Use option 'names no' to turn use of names off
MIP status(103): integer infeasible
Cplex Time: 0.00sec (det. 0.06 ticks)
Problem is integer infeasible.
No solution returned
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 16
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
Equation Listing SOLVE Shard Using MIP From line 138
---- Objective =E=
Objective.. - 900*path(n2,n1) - 900*path(n2,n5) - 900*path(n2,n6) - 4250*path(n3,n1) - 4250*path(n3,n7) - 2800*path(n4,n1) - 2800*path(n4,n7) - 2800*path(n4,n8) - 1550*path(n5,n2) - 1550*path(n5,n6) - 1550*path(n5,n9) - 1500*path(n6,n2)
- 1500*path(n6,n5) - 1500*path(n6,n10) - 1500*path(n6,n11) - 1150*path(n7,n3) - 1150*path(n7,n4) - 1150*path(n7,n12) - 1750*path(n8,n4) - 1750*path(n8,n13) - 4300*path(n9,n5) - 4300*path(n9,n12) - 350*path(n10,n6) - 350*path(n10,n13)
- 2550*path(n11,n6) - 2550*path(n11,n14) - 2550*path(n11,n15) - 5000*path(n12,n7) - 5000*path(n12,n9) - 5000*path(n12,n14) - 2900*path(n13,n8) - 2900*path(n13,n10) - 2900*path(n13,n14) - 5000*path(n14,n11) - 5000*path(n14,n12) - 5000*path(n14,n13)
- 5000*path(n14,n15) - 3850*path(n15,n11) - 3850*path(n15,n14) + CCPT =E= 0 ; (LHS = 0)
---- Balance =E=
Balance(n1).. path(n1,n2) + path(n1,n3) + path(n1,n4) - path(n2,n1) - path(n3,n1) - path(n4,n1) =E= 1 ; (LHS = 1)
Balance(n2).. - path(n1,n2) + path(n2,n1) + path(n2,n5) + path(n2,n6) - path(n5,n2) - path(n6,n2) =E= 1 ; (LHS = 0, INFES = 1 ****)
Balance(n3).. - path(n1,n3) + path(n3,n1) + path(n3,n7) - path(n7,n3) =E= 1 ; (LHS = 0, INFES = 1 ****)
REMAINING 12 ENTRIES SKIPPED
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 17
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
Column Listing SOLVE Shard Using MIP From line 138
---- path
path(n1,n2)
(.LO, .L, .UP, .M = 0, 1, 1, EPS)
1 Balance(n1)
-1 Balance(n2)
path(n1,n3)
(.LO, .L, .UP, .M = 0, 0, 1, EPS)
1 Balance(n1)
-1 Balance(n3)
path(n1,n4)
(.LO, .L, .UP, .M = 0, 0, 1, EPS)
1 Balance(n1)
-1 Balance(n4)
REMAINING 39 ENTRIES SKIPPED
---- CCPT Communication Cost Per Transaction
CCPT
(.LO, .L, .UP, .M = -INF, 4950, +INF, 0)
1 Objective
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 18
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
Model Statistics SOLVE Shard Using MIP From line 138
LOOPS iter iter2
MODEL STATISTICS
BLOCKS OF EQUATIONS 2 SINGLE EQUATIONS 16
BLOCKS OF VARIABLES 2 SINGLE VARIABLES 43
NON ZERO ELEMENTS 124 DISCRETE VARIABLES 42
GENERATION TIME = 0.003 SECONDS 3 MB 25.1.3 r4e34d435fbd LEX-LEG
EXECUTION TIME = 0.003 SECONDS 3 MB 25.1.3 r4e34d435fbd LEX-LEG
L O O P S iter iter2
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 19
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
Solution Report SOLVE Shard Using MIP From line 138
S O L V E S U M M A R Y
MODEL Shard OBJECTIVE CCPT
TYPE MIP DIRECTION MINIMIZE
SOLVER CPLEX FROM LINE 138
**** SOLVER STATUS 1 Normal Completion
**** MODEL STATUS 10 Integer Infeasible
**** OBJECTIVE VALUE NA
RESOURCE USAGE, LIMIT 0.006 1000.000
ITERATION COUNT, LIMIT 0 2000000000
IBM ILOG CPLEX 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEG x86 64bit/Linux
Cplex 12.8.0.0
Space for names approximately 0.00 Mb
Use option 'names no' to turn use of names off
MIP status(103): integer infeasible
Cplex Time: 0.00sec (det. 0.06 ticks)
Problem is integer infeasible.
No solution returned
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 20
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
Equation Listing SOLVE Shard Using MIP From line 138
---- Objective =E=
Objective.. - 900*path(n2,n1) - 900*path(n2,n5) - 900*path(n2,n6) - 4250*path(n3,n1) - 4250*path(n3,n7) - 2800*path(n4,n1) - 2800*path(n4,n7) - 2800*path(n4,n8) - 1550*path(n5,n2) - 1550*path(n5,n6) - 1550*path(n5,n9) - 1500*path(n6,n2)
- 1500*path(n6,n5) - 1500*path(n6,n10) - 1500*path(n6,n11) - 1150*path(n7,n3) - 1150*path(n7,n4) - 1150*path(n7,n12) - 1750*path(n8,n4) - 1750*path(n8,n13) - 4300*path(n9,n5) - 4300*path(n9,n12) - 350*path(n10,n6) - 350*path(n10,n13)
- 2550*path(n11,n6) - 2550*path(n11,n14) - 2550*path(n11,n15) - 5000*path(n12,n7) - 5000*path(n12,n9) - 5000*path(n12,n14) - 2900*path(n13,n8) - 2900*path(n13,n10) - 2900*path(n13,n14) - 5000*path(n14,n11) - 5000*path(n14,n12) - 5000*path(n14,n13)
- 5000*path(n14,n15) - 3850*path(n15,n11) - 3850*path(n15,n14) + CCPT =E= 0 ; (LHS = 0)
---- Balance =E=
Balance(n1).. path(n1,n2) + path(n1,n3) + path(n1,n4) - path(n2,n1) - path(n3,n1) - path(n4,n1) =E= 1 ; (LHS = 1)
Balance(n2).. - path(n1,n2) + path(n2,n1) + path(n2,n5) + path(n2,n6) - path(n5,n2) - path(n6,n2) =E= 1 ; (LHS = 0, INFES = 1 ****)
Balance(n3).. - path(n1,n3) + path(n3,n1) + path(n3,n7) - path(n7,n3) =E= 1 ; (LHS = 0, INFES = 1 ****)
REMAINING 12 ENTRIES SKIPPED
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 21
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
Column Listing SOLVE Shard Using MIP From line 138
---- path
path(n1,n2)
(.LO, .L, .UP, .M = 0, 1, 1, EPS)
1 Balance(n1)
-1 Balance(n2)
path(n1,n3)
(.LO, .L, .UP, .M = 0, 0, 1, EPS)
1 Balance(n1)
-1 Balance(n3)
path(n1,n4)
(.LO, .L, .UP, .M = 0, 0, 1, EPS)
1 Balance(n1)
-1 Balance(n4)
REMAINING 39 ENTRIES SKIPPED
---- CCPT Communication Cost Per Transaction
CCPT
(.LO, .L, .UP, .M = -INF, 4950, +INF, 0)
1 Objective
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 22
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
Model Statistics SOLVE Shard Using MIP From line 138
LOOPS iter iter3
MODEL STATISTICS
BLOCKS OF EQUATIONS 2 SINGLE EQUATIONS 16
BLOCKS OF VARIABLES 2 SINGLE VARIABLES 43
NON ZERO ELEMENTS 124 DISCRETE VARIABLES 42
GENERATION TIME = 0.024 SECONDS 3 MB 25.1.3 r4e34d435fbd LEX-LEG
EXECUTION TIME = 0.024 SECONDS 3 MB 25.1.3 r4e34d435fbd LEX-LEG
L O O P S iter iter3
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 23
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
Solution Report SOLVE Shard Using MIP From line 138
S O L V E S U M M A R Y
MODEL Shard OBJECTIVE CCPT
TYPE MIP DIRECTION MINIMIZE
SOLVER CPLEX FROM LINE 138
**** SOLVER STATUS 1 Normal Completion
**** MODEL STATUS 10 Integer Infeasible
**** OBJECTIVE VALUE NA
RESOURCE USAGE, LIMIT 0.004 1000.000
ITERATION COUNT, LIMIT 0 2000000000
IBM ILOG CPLEX 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEG x86 64bit/Linux
Cplex 12.8.0.0
Space for names approximately 0.00 Mb
Use option 'names no' to turn use of names off
MIP status(103): integer infeasible
Cplex Time: 0.00sec (det. 0.06 ticks)
Problem is integer infeasible.
No solution returned
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 24
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
Equation Listing SOLVE Shard Using MIP From line 138
---- Objective =E=
Objective.. - 900*path(n2,n1) - 900*path(n2,n5) - 900*path(n2,n6) - 4250*path(n3,n1) - 4250*path(n3,n7) - 2800*path(n4,n1) - 2800*path(n4,n7) - 2800*path(n4,n8) - 1550*path(n5,n2) - 1550*path(n5,n6) - 1550*path(n5,n9) - 1500*path(n6,n2)
- 1500*path(n6,n5) - 1500*path(n6,n10) - 1500*path(n6,n11) - 1150*path(n7,n3) - 1150*path(n7,n4) - 1150*path(n7,n12) - 1750*path(n8,n4) - 1750*path(n8,n13) - 4300*path(n9,n5) - 4300*path(n9,n12) - 350*path(n10,n6) - 350*path(n10,n13)
- 2550*path(n11,n6) - 2550*path(n11,n14) - 2550*path(n11,n15) - 5000*path(n12,n7) - 5000*path(n12,n9) - 5000*path(n12,n14) - 2900*path(n13,n8) - 2900*path(n13,n10) - 2900*path(n13,n14) - 5000*path(n14,n11) - 5000*path(n14,n12) - 5000*path(n14,n13)
- 5000*path(n14,n15) - 3850*path(n15,n11) - 3850*path(n15,n14) + CCPT =E= 0 ; (LHS = 0)
---- Balance =E=
Balance(n1).. path(n1,n2) + path(n1,n3) + path(n1,n4) - path(n2,n1) - path(n3,n1) - path(n4,n1) =E= 1 ; (LHS = 1)
Balance(n2).. - path(n1,n2) + path(n2,n1) + path(n2,n5) + path(n2,n6) - path(n5,n2) - path(n6,n2) =E= 1 ; (LHS = 0, INFES = 1 ****)
Balance(n3).. - path(n1,n3) + path(n3,n1) + path(n3,n7) - path(n7,n3) =E= 1 ; (LHS = 0, INFES = 1 ****)
REMAINING 12 ENTRIES SKIPPED
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 25
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
Column Listing SOLVE Shard Using MIP From line 138
---- path
path(n1,n2)
(.LO, .L, .UP, .M = 0, 1, 1, EPS)
1 Balance(n1)
-1 Balance(n2)
path(n1,n3)
(.LO, .L, .UP, .M = 0, 0, 1, EPS)
1 Balance(n1)
-1 Balance(n3)
path(n1,n4)
(.LO, .L, .UP, .M = 0, 0, 1, EPS)
1 Balance(n1)
-1 Balance(n4)
REMAINING 39 ENTRIES SKIPPED
---- CCPT Communication Cost Per Transaction
CCPT
(.LO, .L, .UP, .M = -INF, 4950, +INF, 0)
1 Objective
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 26
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
Model Statistics SOLVE Shard Using MIP From line 138
LOOPS iter iter4
MODEL STATISTICS
BLOCKS OF EQUATIONS 2 SINGLE EQUATIONS 16
BLOCKS OF VARIABLES 2 SINGLE VARIABLES 43
NON ZERO ELEMENTS 124 DISCRETE VARIABLES 42
GENERATION TIME = 0.193 SECONDS 3 MB 25.1.3 r4e34d435fbd LEX-LEG
EXECUTION TIME = 0.195 SECONDS 3 MB 25.1.3 r4e34d435fbd LEX-LEG
L O O P S iter iter4
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 27
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
Solution Report SOLVE Shard Using MIP From line 138
S O L V E S U M M A R Y
MODEL Shard OBJECTIVE CCPT
TYPE MIP DIRECTION MINIMIZE
SOLVER CPLEX FROM LINE 138
**** SOLVER STATUS 1 Normal Completion
**** MODEL STATUS 10 Integer Infeasible
**** OBJECTIVE VALUE NA
RESOURCE USAGE, LIMIT 0.008 1000.000
ITERATION COUNT, LIMIT 0 2000000000
IBM ILOG CPLEX 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEG x86 64bit/Linux
Cplex 12.8.0.0
Space for names approximately 0.00 Mb
Use option 'names no' to turn use of names off
MIP status(103): integer infeasible
Cplex Time: 0.00sec (det. 0.06 ticks)
Problem is integer infeasible.
No solution returned
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 28
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
Equation Listing SOLVE Shard Using MIP From line 138
---- Objective =E=
Objective.. - 900*path(n2,n1) - 900*path(n2,n5) - 900*path(n2,n6) - 4250*path(n3,n1) - 4250*path(n3,n7) - 2800*path(n4,n1) - 2800*path(n4,n7) - 2800*path(n4,n8) - 1550*path(n5,n2) - 1550*path(n5,n6) - 1550*path(n5,n9) - 1500*path(n6,n2)
- 1500*path(n6,n5) - 1500*path(n6,n10) - 1500*path(n6,n11) - 1150*path(n7,n3) - 1150*path(n7,n4) - 1150*path(n7,n12) - 1750*path(n8,n4) - 1750*path(n8,n13) - 4300*path(n9,n5) - 4300*path(n9,n12) - 350*path(n10,n6) - 350*path(n10,n13)
- 2550*path(n11,n6) - 2550*path(n11,n14) - 2550*path(n11,n15) - 5000*path(n12,n7) - 5000*path(n12,n9) - 5000*path(n12,n14) - 2900*path(n13,n8) - 2900*path(n13,n10) - 2900*path(n13,n14) - 5000*path(n14,n11) - 5000*path(n14,n12) - 5000*path(n14,n13)
- 5000*path(n14,n15) - 3850*path(n15,n11) - 3850*path(n15,n14) + CCPT =E= 0 ; (LHS = 0)
---- Balance =E=
Balance(n1).. path(n1,n2) + path(n1,n3) + path(n1,n4) - path(n2,n1) - path(n3,n1) - path(n4,n1) =E= 1 ; (LHS = 1)
Balance(n2).. - path(n1,n2) + path(n2,n1) + path(n2,n5) + path(n2,n6) - path(n5,n2) - path(n6,n2) =E= 1 ; (LHS = 0, INFES = 1 ****)
Balance(n3).. - path(n1,n3) + path(n3,n1) + path(n3,n7) - path(n7,n3) =E= 1 ; (LHS = 0, INFES = 1 ****)
REMAINING 12 ENTRIES SKIPPED
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 29
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
Column Listing SOLVE Shard Using MIP From line 138
---- path
path(n1,n2)
(.LO, .L, .UP, .M = 0, 1, 1, EPS)
1 Balance(n1)
-1 Balance(n2)
path(n1,n3)
(.LO, .L, .UP, .M = 0, 0, 1, EPS)
1 Balance(n1)
-1 Balance(n3)
path(n1,n4)
(.LO, .L, .UP, .M = 0, 0, 1, EPS)
1 Balance(n1)
-1 Balance(n4)
REMAINING 39 ENTRIES SKIPPED
---- CCPT Communication Cost Per Transaction
CCPT
(.LO, .L, .UP, .M = -INF, 4950, +INF, 0)
1 Objective
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 30
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
Model Statistics SOLVE Shard Using MIP From line 138
LOOPS iter iter5
MODEL STATISTICS
BLOCKS OF EQUATIONS 2 SINGLE EQUATIONS 16
BLOCKS OF VARIABLES 2 SINGLE VARIABLES 43
NON ZERO ELEMENTS 124 DISCRETE VARIABLES 42
GENERATION TIME = 0.002 SECONDS 3 MB 25.1.3 r4e34d435fbd LEX-LEG
EXECUTION TIME = 0.003 SECONDS 3 MB 25.1.3 r4e34d435fbd LEX-LEG
L O O P S iter iter5
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 31
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
Solution Report SOLVE Shard Using MIP From line 138
S O L V E S U M M A R Y
MODEL Shard OBJECTIVE CCPT
TYPE MIP DIRECTION MINIMIZE
SOLVER CPLEX FROM LINE 138
**** SOLVER STATUS 1 Normal Completion
**** MODEL STATUS 10 Integer Infeasible
**** OBJECTIVE VALUE NA
RESOURCE USAGE, LIMIT 0.004 1000.000
ITERATION COUNT, LIMIT 0 2000000000
IBM ILOG CPLEX 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEG x86 64bit/Linux
Cplex 12.8.0.0
Space for names approximately 0.00 Mb
Use option 'names no' to turn use of names off
MIP status(103): integer infeasible
Cplex Time: 0.00sec (det. 0.06 ticks)
Problem is integer infeasible.
No solution returned
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 32
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
Equation Listing SOLVE Shard Using MIP From line 138
---- Objective =E=
Objective.. - 900*path(n2,n1) - 900*path(n2,n5) - 900*path(n2,n6) - 4250*path(n3,n1) - 4250*path(n3,n7) - 2800*path(n4,n1) - 2800*path(n4,n7) - 2800*path(n4,n8) - 1550*path(n5,n2) - 1550*path(n5,n6) - 1550*path(n5,n9) - 1500*path(n6,n2)
- 1500*path(n6,n5) - 1500*path(n6,n10) - 1500*path(n6,n11) - 1150*path(n7,n3) - 1150*path(n7,n4) - 1150*path(n7,n12) - 1750*path(n8,n4) - 1750*path(n8,n13) - 4300*path(n9,n5) - 4300*path(n9,n12) - 350*path(n10,n6) - 350*path(n10,n13)
- 2550*path(n11,n6) - 2550*path(n11,n14) - 2550*path(n11,n15) - 5000*path(n12,n7) - 5000*path(n12,n9) - 5000*path(n12,n14) - 2900*path(n13,n8) - 2900*path(n13,n10) - 2900*path(n13,n14) - 5000*path(n14,n11) - 5000*path(n14,n12) - 5000*path(n14,n13)
- 5000*path(n14,n15) - 3850*path(n15,n11) - 3850*path(n15,n14) + CCPT =E= 0 ; (LHS = 0)
---- Balance =E=
Balance(n1).. path(n1,n2) + path(n1,n3) + path(n1,n4) - path(n2,n1) - path(n3,n1) - path(n4,n1) =E= 1 ; (LHS = 1)
Balance(n2).. - path(n1,n2) + path(n2,n1) + path(n2,n5) + path(n2,n6) - path(n5,n2) - path(n6,n2) =E= 1 ; (LHS = 0, INFES = 1 ****)
Balance(n3).. - path(n1,n3) + path(n3,n1) + path(n3,n7) - path(n7,n3) =E= 1 ; (LHS = 0, INFES = 1 ****)
REMAINING 12 ENTRIES SKIPPED
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 33
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
Column Listing SOLVE Shard Using MIP From line 138
---- path
path(n1,n2)
(.LO, .L, .UP, .M = 0, 1, 1, EPS)
1 Balance(n1)
-1 Balance(n2)
path(n1,n3)
(.LO, .L, .UP, .M = 0, 0, 1, EPS)
1 Balance(n1)
-1 Balance(n3)
path(n1,n4)
(.LO, .L, .UP, .M = 0, 0, 1, EPS)
1 Balance(n1)
-1 Balance(n4)
REMAINING 39 ENTRIES SKIPPED
---- CCPT Communication Cost Per Transaction
CCPT
(.LO, .L, .UP, .M = -INF, 4950, +INF, 0)
1 Objective
GAMS 25.1.3 r4e34d435fbd Released Oct 30, 2018 LEX-LEG x86 64bit/Linux 04/24/19 17:20:17 Page 34
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
Model Statistics SOLVE Shard Using MIP From line 138
LOOPS iter iter6
MODEL STATISTICS
BLOCKS OF EQUATIONS 2 SINGLE EQUATIONS 16