Timeline for Assignment problem where assignments must be done sequentially
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 26, 2020 at 17:28 | vote | accept | DeltaIV | ||
| Jan 24, 2020 at 22:53 | comment | added | prubin♦ | Since you are minimizing, you just need to add a single nonnegative continuous variable (call it $d$), change the objective to minimize $d+c\cdot m$, and add the constraints $-d \le \sum_i v_i x_{i,2} - 0.7V \le d$. | |
| Jan 24, 2020 at 22:31 | comment | added | DeltaIV | Thanks a lot. Just a last doubt: what do you mean by "linearizing" a nondifferentiable function? Should I solve two different optimization problems subject to same constraints, $\sum_i v_i x_{i,2} - 0.7V + c \cdot m$ and $0.7V-\sum_i v_i x_{i,2}+ c \cdot m$, then compare the solutions? | |
| Jan 24, 2020 at 18:37 | history | edited | RobPratt | CC BY-SA 4.0 |
added 898 characters in body
|
| Jan 24, 2020 at 18:27 | comment | added | RobPratt | I added more explanation just now. | |
| Jan 24, 2020 at 18:27 | history | edited | RobPratt | CC BY-SA 4.0 |
added 898 characters in body
|
| Jan 24, 2020 at 16:55 | comment | added | DeltaIV | I understand that $\sum_j x_{i,j} = 1 \ \text{for all $i$}$ because each task is assigned to one and only one worker. However, can you explain the other constraint equations? Also, can you show why $\sum_{i\ge 2} \sum_j y_{i,j}=m$? Finally, once I have defined all these linear constraints, what solver should I use to find a solution? | |
| Jan 24, 2020 at 15:59 | history | answered | RobPratt | CC BY-SA 4.0 |