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
|
// Copyright (C) 2015 - IIT Bombay - FOSSEE
//
// Author: Harpreet Singh
// Organization: FOSSEE, IIT Bombay
// Email: harpreet.mertia@gmail.com
// This file must be used under the terms of the CeCILL.
// This source file is licensed as described in the file COPYING, which
// you should have received as part of this distribution. The terms
// are also available at
// http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
function [xopt,fopt,status,output] = symphony_call(nbVar,nbCon,objCoef,isInt,LB,UB,conMatrix,conLB,conUB,objSense,options)
xopt = [];
fopt = [];
status = [];
output = [];
//Opening Symphony environment
sym_open();
//Setting Options for the Symphpony
setOptions(options);
//Choosing to launch basic or advanced version
if(~issparse(conMatrix)) then
sym_loadProblemBasic(nbVar,nbCon,LB,UB,objCoef,isInt,objSense,conMatrix,conLB,conUB);
else
// Changing to Constraint Matrix into sparse matrix
conMatrix_advanced=sparse(conMatrix);
sym_loadProblem(nbVar,nbCon,LB,UB,objCoef,isInt,objSense,conMatrix_advanced,conLB,conUB);
end
op = sym_solve();
status = sym_getStatus();
if (status == 228 | status == 227 | status == 229 | status == 230 | status == 231 | status == 232 | status == 233) then
xopt = sym_getVarSoln();
// Symphony gives a row matrix converting it to column matrix
xopt = xopt';
fopt = sym_getObjVal();
end
status = sym_getStatus();
output = struct("Iterations" , []);
output.Iterations = sym_getIterCount();
endfunction
|
