pub fn find_farkas(constraints: &[LinExpr]) -> Option<BTreeMap<usize, i64>>Expand description
Given constraints cᵢ ≤ 0, find a non-negative integer combination
Σ λᵢ·cᵢ = (positive constant) ≤ 0 — a Farkas refutation. Returns the
multipliers λᵢ, or None if the system is satisfiable over ℚ (so no rational
Farkas certificate exists).