Struct MiqpProblem 

pub struct MiqpProblem {
    pub qp: QpProblem,
    pub integer_vars: Vec<usize>,
}

Mixed-Integer convex Quadratic Program: minimize 1/2 x^T Q x + c^T x over the QpProblem feasible region with x[j] integral for every j in integer_vars. Only convex (Q PSD) instances are in scope — see MiqpProblem::is_convex.

Fields

qp: QpProblem

Continuous QP relaxation (objective, constraints, bounds).

integer_vars: Vec<usize>

Sorted, de-duplicated indices of variables required to be integral.

Implementations

impl MiqpProblem

pub fn new( qp: QpProblem, integer_vars: Vec<usize>, ) -> Result<Self, MipProblemError>

Build an MIQP from a QP relaxation and the integer-variable indices.

Convexity is not enforced here; the solver checks is_convex and rejects non-PSD Q. integer_vars is sorted and de-duplicated; an empty set means a plain QP (the solver falls back to the QP path).

pub fn num_vars(&self) -> usize

Number of decision variables.

pub fn is_convex(&self) -> bool

Whether the objective is convex (Q positive semidefinite). The QP relaxation is a valid lower bound only when this holds; a non-convex MIQP is out of scope.

Trait Implementations

impl Clone for MiqpProblem

fn clone(&self) -> MiqpProblem

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for MiqpProblem

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.