The non-integer optimality conjecture for duo-equidistant vectors

At least 2 years old · documented by

Assume v<nxv<nx, set m=⌊v/x⌋m=\left\lfloor v/x\right\rfloor, r=v−mxr=v-mx, and y=x−ry=x-r, and let Λ(v)\Lambda(v), ff, and Γ(m,y,r)\Gamma(m,y,r) be as defined in the paper.

Non-integer optimality conjecture. The set

Conv⁡(Γ(m,y,r))\operatorname{Conv}(\Gamma(m,y,r))

should be part of the set of optimal solutions of the minimization problem

min⁡{f(v):v∈Λ(v)}.\min\{f(\boldsymbol{v}):\boldsymbol{v}\in\Lambda(v)\}.

The statement is proved in the paper only in the case Δy=Δz\Delta_y=\Delta_z; the remainder of the cases is explicitly left open.

References

Primary source

Royi Jacobovic and Nikki Levering, “Minimizing the externalities variance in a LCFS-PR M/G/1 queue under various constraints”, arXiv:2308.08189 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.