Re: [Help-glpk] Help: How to build MIP model

[lucacoopers]

You still have reason Jeff. I'm sorry... :-(I've probably done something
wrong in the modeling phase of the problem.

I have another problem. 
Is as follows:

minimize { sum[from i=1 to 96] 0,1*x1(i)+0,2*x2(i)+0,3*x3(i)+40*x4(i) }

constraints:

x1(i)+x2(i)+x3(i)=c(i)
sum[from i=1 to 96] x4(i)=10
0<=x1(i)<=100
0<=x2(i)<=100
0<=x3(i)<=100
0<=x4(i)<=1  binary

x1, x2, x3, x4, c are arrays of 96 elements.
c is and array of konw numbers.


I hope that this problem can be write with a glpk routine in c language.
If are some other problems, have you an example of a similar routine that
uses vectors and  summation?

thanks!!:-)


-- 
View this message in context: 
http://old.nabble.com/Help%3A-How-to-build-MIP-model-tp34858053p34859100.html
Sent from the Gnu - GLPK - Help mailing list archive at Nabble.com.