-
Notifications
You must be signed in to change notification settings - Fork 0
/
Script_Github.cs
470 lines (387 loc) · 17.2 KB
/
Script_Github.cs
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
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using System.IO;
using System.Data;
using ILOG.Concert;
using ILOG.CPLEX;
namespace Example1
{
public class Data
{
public int[][] mutMatrix = null;
public double[][] connectMat = null;
// Constructor.
public Data()
{
}
public void ReadData(string arquivo)
{
int lin, col = 0;
// Opens file to read data.
StreamReader ObjReader = new StreamReader(arquivo, Encoding.UTF7);
string sLine = "";
// Reads dimension of mutation matrix.
sLine = ObjReader.ReadLine();
string[] variavel = sLine.Split('\t');
lin = Convert.ToInt32(variavel[0]);
col = Convert.ToInt32(variavel[1]);
// Allocates memory for mutation matrix.
this.mutMatrix = new int[lin][];
for (int i = 0; i < lin; i++)
this.mutMatrix[i] = new int[col];
// Loads entries of mutation matrix.
for (int i = 0; i < lin; i++)
{
sLine = ObjReader.ReadLine();
variavel = sLine.Split('\t');
for (int j = 0; j < col; j++)
this.mutMatrix[i][j] = Convert.ToInt32(variavel[j]);
}
// Skips one line.
sLine = ObjReader.ReadLine();
// Reads dimension of connectivity matrix.
sLine = ObjReader.ReadLine();
variavel = sLine.Split('\t');
lin = Convert.ToInt32(variavel[0]);
col = Convert.ToInt32(variavel[1]);
// Allocates memory for connectivity matrix.
this.connectMat = new double[lin][];
for (int i = 0; i < lin; i++)
this.connectMat[i] = new double[col];
// Loads entries of connectivity matrix.
for (int i = 0; i < lin; i++)
{
sLine = ObjReader.ReadLine();
variavel = sLine.Split('\t');
for (int j = 0; j < col; j++)
this.connectMat[i][j] = Convert.ToDouble(variavel[j]);
}
// Closes file.
ObjReader.Close();
}
}
class Program
{
static void Main(string[] args)
{
int nSamples = 0; // Number of samples
int nMutGenes = 0; // Number of mutation genes
int nExpGenes = 0; // Number of expression genes
int nVar = 0; // Number of variables in MILP
int nPathways = 5; // Number of pathways
int nConstraints = 0; // Number of constraints in MILP
Data data = new Data();
// Loads input data.
data.ReadData("../../inputFile.txt");
nSamples = data.mutMatrix.Length;
nMutGenes = data.mutMatrix[0].Length;
nExpGenes = data.connectMat.Length;
// Total number of decision variables:
// pM --> nMutGenes * nPathways
// pE --> nExpGenes * nPathways
// aM --> nSamples * nPathways
// fM --> nSamples * nPathways
nVar = (nMutGenes * nPathways) + (nExpGenes * nPathways) + 2 * (nSamples * nPathways);
// Instance of cplex model.
Cplex cplex = new Cplex();
/* We were having issues with "Out of Memory" errors as we increased the number of samples and number of genes
* To address this, we set parameter NodeFileInd = 3 --> this indicates that node info from MIP optimizer will be compressed
* and written to files instead of accessing the computer memory during the simulation run
*
* */
cplex.SetParam(Cplex.IntParam.NodeFileInd, 3);
// Sets names of decision variables.
string[] name = new string[nVar];
for (int i = 1; i <= nVar; i++)
{
name[i - 1] = "x" + i.ToString();
}
// Sets type, lower and upper bound of decision variables.
NumVarType[] varType = new NumVarType[nVar];
double[] lb = new double[nVar];
double[] ub = new double[nVar];
for (int i = 0; i < nMutGenes * nPathways; i++)
{
// Variable pM is binary.
varType[i] = NumVarType.Bool;
lb[i] = 0;
ub[i] = 1;
}
for (int i = nMutGenes * nPathways; i < (nMutGenes * nPathways) + (nExpGenes * nPathways); i++)
{
// Variable pE is real number.
varType[i] = NumVarType.Float;
lb[i] = 0;
ub[i] = System.Double.MaxValue;
}
for (int i = (nMutGenes * nPathways) + (nExpGenes * nPathways); i < nVar; i++)
{
// Variables aM and fM are binary.
varType[i] = NumVarType.Bool;
lb[i] = 0;
ub[i] = 1;
}
// Decision Variables.
INumVar[] x = cplex.NumVarArray(nVar, lb, ub, varType, name);
// Coeficients of objective function.
double[] objvals = new double[nVar];
int contobjvals = 0;
int idMap = 0; // Mapping index.
// Variable pM.
int[][] pM = new int[nMutGenes][]; // Mapping matrix pM.
for (int i = 0; i < nMutGenes; i++)
{
pM[i] = new int[nPathways];
for (int j = 0; j < nPathways; j++)
{
// Mapping....
pM[i][j] = idMap;
idMap++;
objvals[contobjvals] = 0;
for (int k = 0; k < nSamples; k++)
// Weight associated with first component of objective function = 0.1.
objvals[contobjvals] += 0.1 * data.mutMatrix[k][i];
contobjvals++;
}
}
// Variable pE.
int[][] pE = new int[nExpGenes][];
for (int i = 0; i < nExpGenes; i++)
{
pE[i] = new int[nPathways];
for (int j = 0; j < nPathways; j++)
{
// Mapping....
pE[i][j] = idMap;
idMap++;
// Weight associated with second component of objective function = 0.9.
objvals[contobjvals] = -0.9;
contobjvals++;
}
}
// Variable aM.
int[][] aM = new int[nSamples][];
for (int i = 0; i < nSamples; i++)
{
aM[i] = new int[nPathways];
for (int j = 0; j < nPathways; j++)
{
// Mapping....
aM[i][j] = idMap;
idMap++;
// Weight associated with first component of objective function = 0.1.
objvals[contobjvals] = -0.1;
contobjvals++;
}
}
// Variable fM.
int[][] fM = new int[nSamples][];
for (int i = 0; i < nSamples; i++)
{
fM[i] = new int[nPathways];
for (int j = 0; j < nPathways; j++)
{
// Mapping....
fM[i][j] = idMap;
idMap++;
// Weight associated with first component of objective function = 0.1.
objvals[contobjvals] = 0.1;
contobjvals++;
}
}
// Defines the cost function as a minimization of decision variables with corresponding cost coefficients.
cplex.Add(cplex.Minimize(cplex.ScalProd(x, objvals)));
nConstraints = nMutGenes + nExpGenes + 2 * nPathways + nSamples * (nPathways - 1) + (nSamples * nPathways) + (nPathways * nExpGenes); // Total number of constraints.
IRange[] constraint = new IRange[nConstraints];
int contconstraints = 0;
INumExpr[] Expr = null;
// Constraints C1.
Expr = new INumExpr[nPathways];
for (int i = 0; i < nMutGenes; i++)
{
for (int j = 0; j < nPathways; j++)
Expr[j] = x[pM[i][j]];
// Constraints of the form sum(pM) = 1.
constraint[contconstraints] = cplex.AddRange(1, 1); // Defines right hand side (= 1).
constraint[contconstraints].Expr = cplex.Sum(Expr); // Defines left hand side (sum(pM)).
contconstraints++;
}
// Constraints C2.
Expr = new INumExpr[nPathways];
for (int i = 0; i < nExpGenes; i++)
{
for (int j = 0; j < nPathways; j++)
Expr[j] = x[pE[i][j]];
// Constraints of the form sum(pE) > 0.
constraint[contconstraints] = cplex.AddRange(0.000001, System.Double.MaxValue); // Defines right hand side (> 0).
constraint[contconstraints].Expr = cplex.Sum(Expr); // Defines left hand side (sum(pE)).
contconstraints++;
}
// Constraints C3.
Expr = new INumExpr[nMutGenes];
for (int i = 0; i < nPathways; i++)
{
for (int j = 0; j < nMutGenes; j++)
Expr[j] = x[pM[j][i]];
// Constraints of the form sum(pM) >= 1.
constraint[contconstraints] = cplex.AddRange(1, System.Double.MaxValue); // Defines right hand side (>= 1).
constraint[contconstraints].Expr = cplex.Sum(Expr); // Defines left hand side (sum(pM)).
contconstraints++;
}
// Constraints C4.
int id = nMutGenes * nPathways;
Expr = new INumExpr[nExpGenes];
for (int i = 0; i < nPathways; i++)
{
for (int j = 0; j < nExpGenes; j++)
Expr[j] = x[pE[j][i]];
// Constraints of the form sum(pE) > 0.
constraint[contconstraints] = cplex.AddRange(0.000001, System.Double.MaxValue); // Defines right hand side (> 0).
constraint[contconstraints].Expr = cplex.Sum(Expr); // Defines left hand side (sum(pE)).
contconstraints++;
}
// Constraints C5.
id = nMutGenes * nPathways + nExpGenes * nPathways;
for (int i = 0; i < nSamples; i++)
{
// Constraints of the form aM - aM >= 0.
for (int j = 0; j < (nPathways - 1); j++)
{
constraint[contconstraints] = cplex.AddRange(0, System.Double.MaxValue); // Defines right hand side (>= 0).
constraint[contconstraints].Expr = cplex.Sum(cplex.Prod(1.0, x[aM[i][j]]), cplex.Prod(-1.0, x[aM[i][j + 1]])); // Defines left hand side (aM - aM).
contconstraints++;
}
}
// Constraints C6.
Expr = new INumExpr[nMutGenes + 2];
for (int i = 0; i < nSamples; i++) // Goes along lines of mutation matrix.
{
for (int k = 0; k < nPathways; k++)
{
for (int j = 0; j < nMutGenes; j++) // Goes along columns of mutation matrix.
{
Expr[j] = cplex.Prod(data.mutMatrix[i][j], x[pM[j][k]]);
}
Expr[nMutGenes] = cplex.Prod(1.0, x[fM[i][k]]);
Expr[nMutGenes + 1] = cplex.Prod(-1.0, x[aM[i][k]]);
// Constraints of the form sum(mutMat*pM) + fM - aM >= 0.
constraint[contconstraints] = cplex.AddRange(0, System.Double.MaxValue); // Defines right hand side (>= 0).
constraint[contconstraints].Expr = cplex.Sum(Expr); // Defines left hand side (sum(mutMat*pM) + fM - aM).
contconstraints++;
}
}
// Constraints C7.
Expr = new INumExpr[nMutGenes + 1];
for (int i = 0; i < nPathways; i++)
{
for (int j = 0; j < nExpGenes; j++)
{
for (int k = 0; k < nMutGenes; k++)
{
Expr[k] = cplex.Prod(-data.connectMat[j][k], x[pM[k][i]]);
}
Expr[nMutGenes] = cplex.Prod(1.0, x[pE[j][i]]);
// Constraints of the form pE - sum(connectMat*pM) = 0.
constraint[contconstraints] = cplex.AddRange(0, 0); // Defines right hand side (= 0).
constraint[contconstraints].Expr = cplex.Sum(Expr); // Defines left hand side (pE - sum(connectMat*pM)).
contconstraints++;
}
}
// Writes file with MILP model formulation.
cplex.ExportModel("MILP.lp");
try
{
if (cplex.Solve())
{
// Retrieves optimal values of decision variables.
double[] xx = cplex.GetValues(x);
// Displays solution info on command window.
cplex.Output().WriteLine("Solution status=" + cplex.GetStatus());
cplex.Output().WriteLine("Solution value = " + cplex.ObjValue);
// Writes output to txt file.
StreamWriter objWriter = new StreamWriter("Result.txt");
int cont = 0;
string sLine = "";
int nvars = xx.Length;
objWriter.WriteLine("Total cost");
objWriter.WriteLine(cplex.ObjValue.ToString());
objWriter.WriteLine("");
objWriter.WriteLine("Matrix pM");
objWriter.WriteLine("");
for (int i = 0; i < nMutGenes; i++)
{
sLine = "";
for (int j = 0; j < nPathways; j++)
{
sLine += xx[cont].ToString() + "\t";
cont++;
}
objWriter.WriteLine(sLine);
}
// Value of second term of objective function (sum of pE's).
double sumPE = 0.0;
objWriter.WriteLine("");
objWriter.WriteLine("Matrix pE");
objWriter.WriteLine("");
for (int i = 0; i < nExpGenes; i++)
{
sLine = "";
for (int j = 0; j < nPathways; j++)
{
sLine += xx[cont].ToString() + "\t";
cont++;
// Computes running sum of pE's.
sumPE = sumPE + xx[cont];
}
objWriter.WriteLine(sLine);
}
objWriter.WriteLine("");
objWriter.WriteLine("Sum pE");
objWriter.WriteLine(sumPE.ToString());
objWriter.WriteLine("");
objWriter.WriteLine("");
objWriter.WriteLine("Matrix aM");
objWriter.WriteLine("");
for (int i = 0; i < nSamples; i++)
{
sLine = "";
for (int j = 0; j < nPathways; j++)
{
sLine += xx[cont].ToString() + "\t";
cont++;
}
objWriter.WriteLine(sLine);
}
objWriter.WriteLine("");
objWriter.WriteLine("Matrix fM");
objWriter.WriteLine("");
for (int i = 0; i < nSamples; i++)
{
sLine = "";
for (int j = 0; j < nPathways; j++)
{
sLine += xx[cont].ToString() + "\t";
cont++;
}
objWriter.WriteLine(sLine);
}
objWriter.Close();
// Writes optimal solution info to file.
cplex.WriteSolution("solution");
}
else
{
cplex.GetCplexStatus();
}
cplex.End();
}
catch (ILOG.Concert.Exception e)
{
System.Console.WriteLine("Concert exception '" + e + "' caught");
}
}
}
}