Function combine 

pub fn combine(
    constraints: &[LinExpr],
    multipliers: &BTreeMap<usize, i64>,
) -> LinExpr

Σ multipliers[i]·constraints[i]. For a valid Farkas certificate this is a bare positive constant (the variables cancel) — that constant is the d in the reconstructed contradiction 0 ≤ -d.