Struct grb::callback::MIPNodeCtx

pub struct MIPNodeCtx<'a>(_);

Callback context object during MIPNODE.

Implementations

impl<'a> MIPNodeCtx<'a>

pub fn add_cut(&self, constr: IneqExpr) -> Result<()>

Add a new (linear) cutting plane to the MIP model.

pub fn status(&self) -> Result<Status>

Optimization status of current MIP node.

pub fn get_solution<I, V>(&self, vars: I) -> Result<Vec<f64>> where
    V: Borrow<Var>,
    I: IntoIterator<Item = V>, 

Get the optimal solution to this MIP node relaxation. This will query the solution for ALL variables, and return the subset provided, so you should avoid calling this method multiple times per callback.

pub fn set_solution<I, V, T>(&self, solution: I) -> Result<Option<f64>> where
    V: Borrow<Var>,
    T: Borrow<f64>,
    I: IntoIterator<Item = (V, T)>, 

Provide a new feasible solution for a MIP model. Not all variables need to be given.

On success, if the solution was feasible the method returns the computed objective value, otherwise returns None.

pub fn terminate(&self)

Signal Gurobi to terminate the optimisation. Will not take effect immediately

pub fn runtime(&self) -> Result<f64>

Retrieve the elapsed solver runtime in seconds.

pub fn add_lazy(&self, constr: IneqExpr) -> Result<()>

Add a new lazy constraint to the model

Important: Requires that the LazyConstraints parameter is set to 1

pub fn obj_best(&self) -> Result<f64>

Current best objective.

pub fn obj_bnd(&self) -> Result<f64>

Current best objective bound.

pub fn node_cnt(&self) -> Result<f64>

Current explored node count.

pub fn sol_cnt(&self) -> Result<i32>

Current count of feasible solutions found.