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)
\(WG_{1k}^{\pm }\)
[250, 350]
[300, 400]
[350, 440]
\(WG_{2k}^{\pm }\)
[150, 250]
[185, 265]
[215, 285]
\(WG_{3k}^{\pm }\)