Hello everyone!I 'm new to the forum! I recently started using GNU glpk. I
have problems in the construction of the MIP model .
The problem is as follows:
minimize { sum[from i=1 to 96] of {c1*x1(i)+c2*x2(i)+c3*x3(i)} }
with this constraints:
x1(i)+x2(i)+x3(i)=c4(i)
x1(i)+x3(i)=c5
x1>=5
0<=x2<=1 binary
0<=x3<=1 binary
where x1, x2, x3 and c4 are vectors of 96 elements. c1,c2,c3,c5 are
contants.
someone could write the corresponding model?
I am using the language c and visual studio as a compiler.
Thank you very much!!!:-)
--
View this message in context:
http://old.nabble.com/Help%3A-How-to-build-MIP-model-tp34858053p34858053.html
Sent from the Gnu - GLPK - Help mailing list archive at Nabble.com.
_______________________________________________
Help-glpk mailing list
Help-glpk@gnu.org
https://lists.gnu.org/mailman/listinfo/help-glpk
