Struct mosek::Liinfitem

source ·
#[non_exhaustive]
pub struct Liinfitem;
Expand description

Long integer information items.

Implementations§

source§

impl Liinfitem

source

pub const ANA_PRO_SCALARIZED_CONSTRAINT_MATRIX_NUM_COLUMNS: i32 = 0i32

Number of columns in the scalarized constraint matrix.

source

pub const ANA_PRO_SCALARIZED_CONSTRAINT_MATRIX_NUM_NZ: i32 = 1i32

Number of non-zero entries in the scalarized constraint matrix.

source

pub const ANA_PRO_SCALARIZED_CONSTRAINT_MATRIX_NUM_ROWS: i32 = 2i32

Number of rows in the scalarized constraint matrix.

source

pub const BI_CLEAN_DUAL_DEG_ITER: i32 = 3i32

Number of dual degenerate clean iterations performed in the basis identification.

source

pub const BI_CLEAN_DUAL_ITER: i32 = 4i32

Number of dual clean iterations performed in the basis identification.

source

pub const BI_CLEAN_PRIMAL_DEG_ITER: i32 = 5i32

Number of primal degenerate clean iterations performed in the basis identification.

source

pub const BI_CLEAN_PRIMAL_ITER: i32 = 6i32

Number of primal clean iterations performed in the basis identification.

source

pub const BI_DUAL_ITER: i32 = 7i32

Number of dual pivots performed in the basis identification.

source

pub const BI_PRIMAL_ITER: i32 = 8i32

Number of primal pivots performed in the basis identification.

source

pub const INTPNT_FACTOR_NUM_NZ: i32 = 9i32

Number of non-zeros in factorization.

source

pub const MIO_ANZ: i32 = 10i32

Number of non-zero entries in the constraint matrix of the problem to be solved by the mixed-integer optimizer.

source

pub const MIO_INTPNT_ITER: i32 = 11i32

Number of interior-point iterations performed by the mixed-integer optimizer.

source

pub const MIO_NUM_DUAL_ILLPOSED_CER: i32 = 12i32

Number of dual illposed certificates encountered by the mixed-integer optimizer.

source

pub const MIO_NUM_PRIM_ILLPOSED_CER: i32 = 13i32

Number of primal illposed certificates encountered by the mixed-integer optimizer.

source

pub const MIO_PRESOLVED_ANZ: i32 = 14i32

Number of non-zero entries in the constraint matrix of the problem after the mixed-integer optimizer’s presolve.

source

pub const MIO_SIMPLEX_ITER: i32 = 15i32

Number of simplex iterations performed by the mixed-integer optimizer.

source

pub const RD_NUMACC: i32 = 16i32

Number of affince conic constraints.

source

pub const RD_NUMANZ: i32 = 17i32

Number of non-zeros in A that is read.

source

pub const RD_NUMDJC: i32 = 18i32

Number of disjuncive constraints.

source

pub const RD_NUMQNZ: i32 = 19i32

Number of Q non-zeros.

source

pub const SIMPLEX_ITER: i32 = 20i32

Number of iterations performed by the simplex optimizer.

source

pub const END: i32 = 20i32

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.