[Top][All Lists]

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

[Help-glpk] Planning problem : dynamic constraint

From: Freund Olivier
Subject: [Help-glpk] Planning problem : dynamic constraint
Date: Thu, 17 Aug 2006 01:29:54 -0700 (PDT)

Hello, i am a french student in work placement experience

I am working in an application which allocate some employees to some
activities each quater during a period of two or four weeks. So this period
is divided into quaters which are indexed from one to N.

My modelling describes a MIP problem which has one binary suscripted
variable Ag[i,j,k] for all dummy indices i,j,k. Ag[i,j,k] is true if the
employee i is allocated to activity j during the quater number k. If this
employee isn't allocated to activity j during the quater k, Ag[i,j,k] is

My problem is that i have to model the constraint "an employee i which is
allocated to an activity j has to be allocated to this activity during T[j]
consecutives quaters at least". T[j] is a suscripted integer parameter which
depends on the activity j and this parameter has already been assigned.

Thanks to help me
View this message in context:
Sent from the Gnu - GLPK - Help forum at

reply via email to

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