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
|
// An example with equality constraints and variable bounds
// A basic case :
c = -1*[20,10,15]';
A = [3,2,5;
2,1,1;
1,1,3;
5,2,4]
b = [ 55;26;30;57]
Aeq = [2 3 5]
beq = [5]
intcon = [];
lb = repmat(0,3,1);
ub = repmat(8,3,1);
// Output
//Problem loaded into environment.
//Note: There is no limit on time.
//An optimal solution has been found.
// output =
//
// Iterations: 1
// status =
//
// 227.
// f =
//
// - 50.
// x =
//
// 2.5
// 0.
// 0.
// Calling Symphony
[x,f,status,output] = symphonymat(c,intcon,A,b,Aeq,beq,lb,ub)
|
