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
|
// Check for size of Objective Coefficient
// A basic case :
// Objective function
c = [20,10,15]';
// Lower Bound of variable
lb = repmat(0,3,1);
// Upper Bound of variables
ub = repmat(%inf,3,1);
// Constraint Matrix
A = [3,2,5;
2,1,1;
1,1,3;
5,2,4]
// Lower Bound of constrains
conlb = repmat(-%inf,4,1)
// Upper Bound of constrains
conub = [ 55;26;30;57]
// Row Matrix for telling symphony that the is integer or not
isInt = [repmat(%f,1,3)];
// Output
//Problem loaded into environment.
//
//Note: There is no limit on time.
//
//An optimal solution has been found.
//
// 0.
//
// Iterations: 1
//
// output
//
// 227.
//
// status
//
// 268.
//
// f
//
// 1.8
// 20.8
// 1.6
//
// x
// Calling Symphony
[x,f,status,output] = symphony(3,4,c,isInt,lb,ub,A,conlb,conub,-1)
disp("x",x,"f",f,"status",status,"output",output);
|
