From: Using concave optimization methods for inexact quadratic programming problems with an application to waste management
Time span (k = 1)
Time span (k = 2)
Time span (k = 3)
\(OP_{1k}^{\pm }\)
[35, 37.5]
[50, 53]
[64, 65]
\(OP_{2k}^{\pm }\)
[62.5, 63]
[75, 77]
[83.5, 87.5]