Finite coefficients, one per index; exact positive and negative zeros are omitted internally.
Integer variable indices in [0, n); order and duplicate indices are preserved.
OptionalkeyThe constraint the row linearises, so a later solve of the next convexification starts from its multiplier.
The interval's lower end; -Infinity for none.
The interval's upper end; Infinity for none.
OptionalweightFinite nonnegative l1 penalty weight; absent for a hard row.
A row of the problem, linear in its variables:
l <= Σ coef·x[index] <= u.