The convex-hull inclusion conjecture for non-integer optimal vectors

Assume v<nxv<nx, let m=v/xm=\left\lfloor v/x\right\rfloor, r=vmxr=v-mx, and y=xry=x-r. Let Γ(m,y,r)\Gamma(m,y,r) be the structured-vector set defined in the paper, and suppose vΛ(v)\boldsymbol{v}\in\Lambda(v) satisfies the preceding conjectural characterization.

Non-integer convex-hull conjecture. Every vector satisfying that characterization should belong to

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

This would identify the vectors described by the componentwise conditions with the convex hull of the duo-equidistant vectors. The claim is not proved or otherwise resolved in the supplied text.

Sources & referencesView supporting material

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.