[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Help-glpk] Mixed Integer Programming (MIP) - binary variable
From: |
Noli Sicad |
Subject: |
Re: [Help-glpk] Mixed Integer Programming (MIP) - binary variable |
Date: |
Wed, 7 Nov 2012 09:21:07 +1100 |
Hi
Do we need to declare another variable for binary in MIP problem?
For example, I got this variable.
var Harvest { s in STAND, p in PERIOD}, default 0;
This set of contraints integer (below) can be converted into MathProg
constraint.
2) S4P1 + S4P2 + S4P3 <= 1
3) S5P1 + S5P2 + S5P3 <= 1
4) S15P1 + S15P2 + S15P3 <= 1
5) S17P2 + S17P3 <= 1
6) S19P3 <= 1
7) S23P1 + S23P2 + S23P3 <= 1
8) S32P3 <= 1
9) S34P1 + S34P2 + S34P3 <= 1
10) S35P2 + S35P3 <= 1
11) S36P2 + S36P3 <= 1
12) S46P1 + S46P2 + S46P3 <= 1
13) S49P1 + S49P2 + S49P3 <= 1
14) S50P1 + S50P2 + S50P3 <= 1
15) S51P1 + S51P2 + S51P3 <= 1
16) S52P2 + S52P3 <= 1
17) S53P1 + S53P2 + S53P3 <= 1
18) S57P1 + S57P2 + S57P3 <= 1
19) S58P1 + S58P2 + S58P3 <= 1
20) S59P1 + S59P2 + S59P3 <= 1
21) S60P2 + S60P3 <= 1
22) S62P1 + S62P2 + S62P3 <= 1
23) S63P1 + S63P2 + S63P3 <= 1
24) S64P1 + S64P2 + S64P3 <= 1
25) S65P1 + S65P2 + S65P3 <= 1
26) S68P1 + S68P2 + S68P3 <= 1
27) S69P1 + S69P2 + S69P3 <= 1
28) S71P1 + S71P2 + S71P3 <= 1
29) S74P1 + S74P2 + S74P3 <= 1
30) S75P1 + S75P2 + S75P3 <= 1
31) S76P1 + S76P2 + S76P3 <= 1
32) S77P1 + S77P2 + S77P3 <= 1
33) S78P1 + S78P2 + S78P3 <= 1
34) S79P1 + S79P2 + S79P3 <= 1
35) S80P1 + S80P2 + S80P3 <= 1
36) S81P1 + S81P2 + S81P3 <= 1
37) S82P1 + S82P2 + S82P3 <= 1
38) S83P1 + S83P2 + S83P3 <= 1
39) S84P1 + S84P2 + S84P3 <= 1
40) S85P1 + S85P2 + S85P3 <= 1
41) S86P1 + S86P2 + S86P3 <= 1
42) S87P1 + S87P2 + S87P3 <= 1
MathProg constraints.
Subject to Stand_cutting { s in STAND}:
sum { p in PERIOD} HarvestTable[s,p] * Harvest[s,p] <=1
Does this constraint (above) takes care the integer problem? In other
words, we don't need the binary (integer) variable to declare in MIP
problem, right?
Thanks.
Regards,
Noli