Each row is of the FORM lhs ≤ Σ(val[j]•col[j]) + const ≤ rhs. For now, val[j]•col[j] can be interpreted as aij•xj (for the difference between columns and VARIABLES see here). The constant is essentially NEEDED for collecting the influence of presolving reductions like variable fixings and aggregations.

The lhs and rhs may take infinite values: A less-than inequality WOULD have lhs = -∞, and a greater-than inequality would have rhs = +∞. For equations lhs is equal to rhs. An infinite left hand side can be recognized by SCIPisInfinity (scip, -lhs), an infinite right hand side can be recognized by SCIPisInfinity (scip, rhs).

Each row is of the form lhs ≤ Σ(val[j]•col[j]) + const ≤ rhs. For now, val[j]•col[j] can be interpreted as aij•xj (for the difference between columns and variables see here). The constant is essentially needed for collecting the influence of presolving reductions like variable fixings and aggregations.

The lhs and rhs may take infinite values: A less-than inequality would have lhs = -∞, and a greater-than inequality would have rhs = +∞. For equations lhs is equal to rhs. An infinite left hand side can be recognized by SCIPisInfinity (scip, -lhs), an infinite right hand side can be recognized by SCIPisInfinity (scip, rhs).