The optimized affine winner-cell bound gives a combinatorial lower bound for the dimension of a secant cone of a monomial image. We show that it need not equal the actual dimension, answering negatively the unrestricted monomial formulation of a question in Draisma's Oberwolfach report. For the six cubic monomials x^3, y^3, z^3, x^2 y, x^2 z, y z^2, the optimized two-cell bound is exactly five, whereas the two-point secant cone is all of C^6. The upper bound follows from a planar separation obstruction; a Jacobian determinant of 216 proves the actual dimension. Disjoint coordinate blocks give, for every r >= 1, a degree-three monomial cone with optimized bound 5r and secant dimension 6r. The affine cones used here are not normal. No counterexample for normal toric embeddings or complete Segre-Veronese systems is claimed. This is an unrefereed preprint; no absolute priority claim is made.
