Re: [Help-glpk] Complex constraint definition

[Tiago Santos]

Hello Heinrich,

Thank you for the answer.

But I'm new in using GLPK and I didn't get completely your point here.

How can I use a binary variable to help there?
And what do you mean by "only one of f, P can be a variable"?.

Thank you,

Tiago

On Sat, Dec 3, 2016 at 11:14 PM, Heinrich Schuchardt <address@hidden> wrote:

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