
From:  Tiago Santos 
Subject:  Re: [Helpglpk] Complex constraint definition 
Date:  Sun, 4 Dec 2016 15:33:34 0200 
Am 03.12.16, 22:42, Tiago Santos <address@hidden> schrieb:______________________________Hello,
I'm trying to model a constraint and that is being so complex to me.
Is there any way to model a constraint like the follwing in GLPK?
I need to restrict that the sum must be equal or greater than Min[j] otherwise 0.
{j in T, i in B}: sum{k in S} f[i,k]*P[j,k] >=Min[j]
OR
{j in T, i in B}: sum{k in S} f[i,k]*P[j,k] =0
Thank you,Tiago
_________________ Helpglpk mailing list address@hidden https://lists.gnu.org/mailman/ listinfo/helpglpk
[Prev in Thread]  Current Thread  [Next in Thread] 