AutoMovie API
    Preparing search index...

    A row of the problem, linear in its variables: l <= Σ coef·x[index] <= u.

    interface IRow {
        coef: readonly number[];
        index: readonly number[];
        key?: string;
        l: number;
        u: number;
        weight?: number;
    }
    Index
    coef: readonly number[]

    Finite coefficients, one per index; exact positive and negative zeros are omitted internally.

    index: readonly number[]

    Integer variable indices in [0, n); order and duplicate indices are preserved.

    key?: string

    The constraint the row linearises, so a later solve of the next convexification starts from its multiplier.

    l: number

    The interval's lower end; -Infinity for none.

    u: number

    The interval's upper end; Infinity for none.

    weight?: number

    Finite nonnegative l1 penalty weight; absent for a hard row.