help-glpk
[Top][All Lists]
Advanced

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

Re: [Help-glpk] Complex constraint definition


From: Heinrich Schuchardt
Subject: Re: [Help-glpk] Complex constraint definition
Date: Sun, 4 Dec 2016 02:14:51 +0100

Hello Tiago,

you will need to add a binary variable.

Only one of f, P can be a variable.

Regards

Heinrich
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
_______________________________________________ Help-glpk mailing list address@hidden https://lists.gnu.org/mailman/listinfo/help-glpk

reply via email to

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