Enum ProblemClass 

pub enum ProblemClass {
    Lp,
    ConvexQp,
    ConvexQcqp,
    NonconvexQp,
    Nlp,
}

The mathematical class of a loaded problem, from most to least specialized. See the module docs and dev-notes/lp-qp-routing.md.

Variants

Lp

Linear objective, linear constraints.

ConvexQp

Convex quadratic objective, linear constraints (Hessian PSD).

ConvexQcqp

Convex quadratic objective and/or convex quadratic constraints. SOCP-representable; routes to the conic (SOCP) interior-point solver.

NonconvexQp

Quadratic but with an indefinite Hessian somewhere. Falls through to the NLP solver for a local minimum.

Nlp

General nonlinear (transcendental terms, higher-degree polynomials, or anything the classifier cannot prove quadratic).

Implementations

impl ProblemClass

pub fn name(self) -> &'static str

Human-readable name for diagnostics and the forced-solver-mismatch error message.

Trait Implementations

impl Clone for ProblemClass

fn clone(&self) -> ProblemClass

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for ProblemClass

impl Debug for ProblemClass

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

Formats the value using the given formatter.

impl Eq for ProblemClass

impl PartialEq for ProblemClass

fn eq(&self, other: &ProblemClass) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for ProblemClass