[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Help-glpk] Help: How to build MIP model
From: |
lucacoopers |
Subject: |
Re: [Help-glpk] Help: How to build MIP model |
Date: |
Fri, 4 Jan 2013 06:01:43 -0800 (PST) |
First, thanks to all. Jeff you're right. I misspelled my problem. The problem
is:
minimize { sum[from i=1 to 96] of {c1*x1(i)+c2*x2+c3*x3(i)} }
with this constraints:
x1(i)+x2+x3(i)=c4(i)
x1(i)+x3(i)=c5
x1(i)>=5
0<=x3(i)<=100
0<=x2<=1 binary
where x1, x3 and c4 are vectors of 96 elements. c1,c2,c3,c5 are
numbers.
Sorry for the mistake. I wish someone would write the problem in a form
similar to that described above. I need to learn how to write a minimization
problem with glpk with the language c.
thanks again to all:-)
--
View this message in context:
http://old.nabble.com/Help%3A-How-to-build-MIP-model-tp34858053p34858938.html
Sent from the Gnu - GLPK - Help mailing list archive at Nabble.com.