Write a program using Miller-Tucker-Zemlin to solve this optimization problem in matlab.

cost = [ 0 227 115 171 23 17 160 234 281 227 0 141 4 102 49 239 94 159 115 141 0 197 207 225 136 26 69 171 4 197 0 299 24 133 32 289 23 102 207 299 0 120 78 241 130 17 49 225 24 120 0 174 165 44 160 239 136 133 78 174 0 37 56 234 94 26 32 241 165 37 0 271 281 159 69 289 130 44 56 271 0 ];

intlinprog(c, intcon, A, b, Aeq, beq, lb, ub); What is c, intcon, A, b, Aeq, be, lb, ub?

--------------

General Formular

Label the cities with the numbers 1, ..., n and define: 1 the path goes from city i to city i X = otherwise For i = 1, ..., n, let Wibe a dummy variable, and finally take Cij > 0 to be the distance from city i to city j. Then TSP can be written as the following integer linear programming problem: min Cij tij: i=1 jij=1 Xij {0,1} U; EZ i, j = 1,...,n; i=2,...,n; Tij = 1 j= 1,...,ne; i=1,171 i= 1,...,n; tij = 1 j=1ji Ub; - ; + nxij 0 to be the distance from city i to city j. Then TSP can be written as the following integer linear programming problem: min Cij tij: i=1 jij=1 Xij {0,1} U; EZ i, j = 1,...,n; i=2,...,n; Tij = 1 j= 1,...,ne; i=1,171 i= 1,...,n; tij = 1 j=1ji Ub; - ; + nxij <-1><-1>