Re: [Help-glpk] Constraint!

[Carlos HERRERA]

OPTIMAL SOLUTION FOUND
Time used:   0.0 secs
Memory used: 0.1 Mb (131558 bytes)
lpx_print_sol: writing LP problem solution to `results-4.txt'...

"joint constraints": it was only to mention that the constraint were increasing 
on having added the previous periods j.

Thanks!

Le mardi 18 décembre 2007 à 15:12 +0300, Andrew Makhorin a écrit :
> > How I can write this constraint in MathProg/AMPL?,
> 
> > (Mathematical form)
> > sum(j=1 to t) sum(i=1 to I) b_ik * x_ij <= sum(j=1 to t) s_kj,
> > t = 1,2,...,J; k = 1,2,...,K).
> 
> s.t. foo{t in 1..J, k in 1..K}:
> sum{j in 1..t, i in 1..I} b[i,k] * x[i,j] <= sum{j in 1..t} s[k,j];
> 
> > The problem is to change the index for the next constraint for to obtain
> > the "joint constraints". I probe with "FOR", but this is not permitted
> > for the constraint. 
> 
> What is "joint constraints" ?
>