The componentwise characterization conjecture for non-integer optimal vectors

At least 2 years old · documented by

Assume v<nxv<nx, let m=⌊v/x⌋m=\left\lfloor v/x\right\rfloor, r=v−mxr=v-mx, and y=x−ry=x-r. Let Δy\Delta_y and Δz\Delta_z be the spacing parameters used in the paper, and write v=vy+vr\boldsymbol{v}=\boldsymbol{v}_y+\boldsymbol{v}_r.

Non-integer characterization conjecture. A vector v∈Λ(v)\boldsymbol{v}\in\Lambda(v) is optimal if and only if it has this decomposition and satisfies, for the relevant indices ll,

∑i=0Δy−1vy,l+i≤y,∑i=0Δyvy,l+i≥y,\sum_{i=0}^{\Delta_y-1}v_{y,l+i}\leq y,\qquad \sum_{i=0}^{\Delta_y}v_{y,l+i}\geq y,

with vy,l=0v_{y,l}=0 when l≤Δy−1l\leq\Delta_y-1 or l≥n−(Δy−1)l\geq n-(\Delta_y-1), together with

∑i=0Δz−1vz,l+i≤y,∑i=0Δzvz,l+i≥y,\sum_{i=0}^{\Delta_z-1}v_{z,l+i}\leq y,\qquad \sum_{i=0}^{\Delta_z}v_{z,l+i}\geq y,

with vz,l=0v_{z,l}=0 when l≤Δz−1l\leq\Delta_z-1 or l≥n−(Δz−1)l\geq n-(\Delta_z-1). The claim is presented as a conjectural description of all optimal solutions; no resolution is supplied.

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.