otspot-core 0.4.0

Core implementation for otspot (LP/QP/MIP solver) — published as a dependency of the otspot facade
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37

//! Step 1: fix variables whose lower and upper bounds coincide.

use super::state::{PostsolveStep, PresolveState, PresolveStatus};
use crate::tolerances::ZERO_TOL;

pub(super) fn step1_fixed_variable(
    st: &mut PresolveState,
    deadline: Option<std::time::Instant>,
) -> Result<(), PresolveStatus> {
    let n = st.bounds.len();
    for j in 0..n {
        if deadline.is_some_and(|d| std::time::Instant::now() >= d) {
            return Ok(());
        }
        if st.removed_cols[j] {
            continue;
        }
        let (lb, ub) = st.bounds[j];
        if lb > ub + ZERO_TOL {
            return Err(PresolveStatus::Infeasible);
        }
        if (lb - ub).abs() < ZERO_TOL {
            let value = lb;
            let col_copy = st.col_entries[j].clone();
            for (row, val) in col_copy {
                if !st.removed_rows[row] {
                    st.b[row] -= val * value;
                }
            }
            st.obj_offset += st.c[j] * value;
            st.removed_cols[j] = true;
            st.postsolve_stack
                .push(PostsolveStep::FixedVariable { orig_col: j, value });
        }
    }
    Ok(())
}