[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

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

From: Raniere Silva
Subject: Re: [Help-glpk] Help: How to build MIP model
Date: Fri, 4 Jan 2013 12:47:15 -0200
User-agent: Mutt/1.5.21 (2010-09-15)


> 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.

See the attach.


Attachment: provaglpk.c
Description: Text Data

reply via email to

[Prev in Thread] Current Thread [Next in Thread]