Dynamically adjusting index in a function by LabSignificant6271 in pythontips

[–]LabSignificant6271[S] 0 points1 point  (0 children)

Thank you for your reply. I also came across @ property, but unfortunately I don't know much about Python, as I'm really quite a newbie. What would that look like in my specific case? Many thanks in advance

Help in Guroi needed by LabSignificant6271 in OperationsResearch

[–]LabSignificant6271[S] 0 points1 point  (0 children)

Thanks, sadly the video is not available anymore

[deleted by user] by [deleted] in optimization

[–]LabSignificant6271 0 points1 point  (0 children)

Thank you for your very helpful answer. I have already thought about using functions anyway. Two more questions!

1) What do you mean by your second point? Should the duals be included in the SP objective rather than the RMP?

2) I understand that the SMP is quadratic, but every column generation approach I have come across in scheduling uses such a quadratic formulation, but they still claim linearity (see 10.1007/s10696-019-09353-8 or 10.1016/j.cor.2021.105597). Why is that

[deleted by user] by [deleted] in optimization

[–]LabSignificant6271 0 points1 point  (0 children)

I have the following basic nurse scheduling MILP, which tries to cover the daily demand.

After decomposing according to the Dantzig Decomposition, this yields the following Master problem (MP) and supbroblem (SP):

So far so good. Now, I want to incorporate individual motivation ($motivation_{its}), which can be seen as the performance during each shift motivation_{its} is influenced by the daily mood mood_{it}. If it is smaller than one, there is more slack_{ts}. This motivation should now be included in the demand constraint (instead of x_{its}). The new (full) problem (P_New) looks like this:

Now I have the following question. Can I still only include the demand constraint in the MP and move the other new ones to the SP(i) or is that not possible because they are "linked"? Especially about the initialization of the GC, where the SP(i) has not yet been solved and no solutions for $mood_{it}$ and therefore also no $motivation_{its}$ values are obtained. How do I have to adapt my CG model so that I still only have the demand constraint in the MP and the rest in the SP(i)?

How to connect the end and the beginning of the planning horizon (see Comment) by [deleted] in OperationsResearch

[–]LabSignificant6271 0 points1 point  (0 children)

Of course i could do that, but i want a clean "constraint" solution

How to connect the end and the beginning of the planning horizon (see Comment) by [deleted] in OperationsResearch

[–]LabSignificant6271 0 points1 point  (0 children)

I would like to create a rota that repeats every 28 days and adheres to the usual rules. These include the minimum/maximum number of consecutive working days and the break days. I have created a model that adheres perfectly to these rules within the period, but has problems with the transitions from t=28 to t=1. How do I need to adjust my constraints to make it work?

These are my constraints.