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
|
lsne-2-240% testlp1_gmp
>> Input file: samplelp.ine
input file samplelp.ine is open
size = 20 x 5
Number Type = rational
H-representation
begin
20 5 rational
0 1 0 0 0
0 0 1 0 0
0 0 0 1 0
0 0 0 0 1
0 3008 20980 -97775 -101225
0 3985 25643 -135871 -130580
0 4324 26978 -133655 -168473
0 3534 25361 -46243 -100407
0 8836 40796 -176661 -215616
0 5376 37562 -182576 -217615
0 4982 33088 -98880 -167278
0 4775 39122 -136701 -193393
0 8046 42958 -225138 -256575
0 8554 48955 -257370 -312877
0 6147 45514 -165274 -227099
0 8366 55140 -203989 -321623
0 13479 68037 -174270 -341743
0 21808 78302 -322990 -487539
1 -4277/5000 -9791/2000 0 0
1 0 0 -25737/1000 -312877/10000
end
--- Running dd_LPSolve ---
* cdd LP solver result
* cdd: a double description code:Version 0.90gmp (May 19, 2000)
* compiled for GMP rational arithmetic.
* Copyright (C) 1996, Komei Fukuda, fukuda@ifor.math.ethz.ch
* #constraints = 20
* #variables = 4
* Algorithm: dual simplex algorithm
* maximization is chosen
* Objective function is
0 + 1 X[ 1] + 1/2 X[ 2] + 1/3 X[ 3] + 1/4 X[ 4]
* LP status: a dual pair (x,y) of optimal solutions found.
begin
primal_solution
1 : 5000/4277
2 : 0
3 : 19925000/581120267
4 : 0
dual_solution
6 : 1/407613
2 : 18187069067/3486721602
19 : 2057990000/1743360801
4 : 114707/1630452
optimal_value : 2057990000/1743360801
end
* number of pivot operations = 10 (ph0 = 4, ph1 = 3, ph2 = 3, ph3 = 0)
*Computation starts at Sun May 21 23:30:19 2000
* terminates at Sun May 21 23:30:19 2000
*Total processor time = 0 seconds
* = 0 h 0 m 0 s
(Iter, #Row, #Total, #Curr, Feas)= 6 5 9 7 3
(Iter, #Row, #Total, #Curr, Feas)= 7 8 9 7 3
(Iter, #Row, #Total, #Curr, Feas)= 8 6 14 9 5
(Iter, #Row, #Total, #Curr, Feas)= 9 7 18 9 5
(Iter, #Row, #Total, #Curr, Feas)= 10 12 21 11 6
(Iter, #Row, #Total, #Curr, Feas)= 11 11 21 11 6
(Iter, #Row, #Total, #Curr, Feas)= 12 10 26 13 10
(Iter, #Row, #Total, #Curr, Feas)= 13 15 26 13 10
(Iter, #Row, #Total, #Curr, Feas)= 14 13 29 15 10
(Iter, #Row, #Total, #Curr, Feas)= 15 16 29 15 10
(Iter, #Row, #Total, #Curr, Feas)= 16 14 34 15 15
All the vertices of the feasible region.
V-representation
begin
15 5 rational
1 0 2000/9791 0 0
1 5000/4277 0 0 0
1 0 2000/9791 51286000/1330312961 0
1 5000/4277 0 19925000/581120267 0
1 5000/4277 0 0 23875000/827141861
1 5000/4277 0 12707515000/376823017893 2877136000/4898699232609
1 1143413390000/1409570226171 88141030000/1409570226171 0 43460900000/1409570226171
1 5000/4277 0 2845715000/23783251846081 52652240000/1829480911237
1 12493061640000/10714427322421 5691430000/10714427322421 0 309613220000/10714427322421
1 0 2000/9791 0 10000/312877
1 241499988750/746539852973 2346752500/15883826659 0 10000/312877
1 127276149881465000/245208557641088631 27849359418340000/245208557641088631 6956201331595000/245208557641088631 705035354360000/81736185880362877
1 15266257972352500/27738073472746771 2998532612235000/27738073472746771 497786252410000/27738073472746771 1279018810000/74364808237927
1 0 2000/9791 3261122022000/87174523590197 103651790000/87174523590197
1 0 0 0 0
end
|
