Matlab implementation of the Simplex algorithm (Table 38.12), we can observe
that the units distribution is totally unrealistic.
References
Andrei N (2011) Criticism of the linear programming algorithms reasoning (in romanian). Academia Rom^ ana, Bucuresti
Carp D, Popa C, Serban C (2013) Iterative solution of inconsistent systems of linear inequalities.
Proc Appl Math Mech (PAMM) 13:407–408
Carp D, Popa C, Serban C (2015) Modified Han algorithm for inconsistent linear inequalities.
Carpathian J Math 31(1):45–52
Table 38.11 The values x ij ,
i ¼ 1 , . . . , 7 , j ¼ 1 , . . . , 7 for
the solution of problem P2
with GA algorithm
i j
1
2
3
4
5
6
7
1
197
165
123
84
78
111
94
2
43
70
48
53
46
41
48
3
72
73
57
54
65
47
103
4
83
67
41
46
52
56
55
5
40
55
32
35
39
42
56
6
51
73
42
45
56
51
62
7
44
42
54
46
45
56
64
Table 38.12 The values x ij ,
i ¼ 1 , . . . , 7 , j ¼ 1 , . . . , 7 for
the solution of problem P2
with Simplex algorithm
i j
1
2
3
4
5
6
7
1
0
0
0
0
0
5 2 0
3 3 0
2
0
0
0
0
3 5 0
0
0
3
0
0
0
360
110
0
0
4
0
0
340
60
0
0
0
5
0
2 2 0
8 0
0
0
0
0
6
1 0 0
2 8 0
0
0
0
0
0
7
3 5 0
0
0
0
0
0
0
Table 38.10 The values x ij ,
i ¼ 1 , . . . , 7 , j ¼ 1 , . . . , 7 for
the solution of problem P2
with MH algorithm
ij
1
2
3
4
5
6
7
1
77
262
365
0
0
160
0
2
0
33
0
331
0
0
0
3
0
0
0
75
107
0
303
4
3 5 8
5 6
0
0
0
0
0
5
0
126
0
0
0
23
165
6
0
8
0
0
3 3 9
0
4 7
7
0
0
41
0
0
323
0
38 Genetic Versus Han-Type Algorithms for Maritime Transportation Problems
643
that the units distribution is totally unrealistic.
References
Andrei N (2011) Criticism of the linear programming algorithms reasoning (in romanian). Academia Rom^ ana, Bucuresti
Carp D, Popa C, Serban C (2013) Iterative solution of inconsistent systems of linear inequalities.
Proc Appl Math Mech (PAMM) 13:407–408
Carp D, Popa C, Serban C (2015) Modified Han algorithm for inconsistent linear inequalities.
Carpathian J Math 31(1):45–52
Table 38.11 The values x ij ,
i ¼ 1 , . . . , 7 , j ¼ 1 , . . . , 7 for
the solution of problem P2
with GA algorithm
i j
1
2
3
4
5
6
7
1
197
165
123
84
78
111
94
2
43
70
48
53
46
41
48
3
72
73
57
54
65
47
103
4
83
67
41
46
52
56
55
5
40
55
32
35
39
42
56
6
51
73
42
45
56
51
62
7
44
42
54
46
45
56
64
Table 38.12 The values x ij ,
i ¼ 1 , . . . , 7 , j ¼ 1 , . . . , 7 for
the solution of problem P2
with Simplex algorithm
i j
1
2
3
4
5
6
7
1
0
0
0
0
0
5 2 0
3 3 0
2
0
0
0
0
3 5 0
0
0
3
0
0
0
360
110
0
0
4
0
0
340
60
0
0
0
5
0
2 2 0
8 0
0
0
0
0
6
1 0 0
2 8 0
0
0
0
0
0
7
3 5 0
0
0
0
0
0
0
Table 38.10 The values x ij ,
i ¼ 1 , . . . , 7 , j ¼ 1 , . . . , 7 for
the solution of problem P2
with MH algorithm
ij
1
2
3
4
5
6
7
1
77
262
365
0
0
160
0
2
0
33
0
331
0
0
0
3
0
0
0
75
107
0
303
4
3 5 8
5 6
0
0
0
0
0
5
0
126
0
0
0
23
165
6
0
8
0
0
3 3 9
0
4 7
7
0
0
41
0
0
323
0
38 Genetic Versus Han-Type Algorithms for Maritime Transportation Problems
643
