fn is_empty_constraint_feasible<OF>(
    right_hand_side: &OF,
    constraint_type: &RangedConstraintRelation<OF>,
) -> bool
where
    OF: OrderedField,
    for<'r> &'r OF: OrderedFieldRef<OF>,
{
    match constraint_type {
        RangedConstraintRelation::Equal => {
            right_hand_side == &OF::zero()
        },
        RangedConstraintRelation::Range(range) => {
            right_hand_side >= &OF::zero() && right_hand_side - range <= OF::zero()
        },
        RangedConstraintRelation::Less => {
            right_hand_side >= &OF::zero()
        },
        RangedConstraintRelation::Greater => {
            right_hand_side <= &OF::zero()
        },
    }
}
/// Whether an empty constraint indicates infeasibility.
///
/// This method will be called when a constraints has no coefficients left. In the case, the
/// constraint should still be satisfied, or the problem is infeasible.
///
/// # Arguments
///
/// * `right_hand_side`: Bound value.
/// * `constraint_type`: Relation that is supposed to hold between right hand side and the inner
/// product of the relevant matrix row with the variable (<a, x>), which in this case is zero.
Whether an empty constraint indicates infeasibility.
This method will be called when a constraints has no coefficients left. In the case, the
constraint should still be satisfied, or the problem is infeasible.
Whether an empty constraint indicates infeasibility . This method will be called when a constraints has no coefficients left . In the case the constraint should still be satisfied or the problem is infeasible .
fn is_empty_constraint_feasible<OF>(
    right_hand_side: &OF,
    constraint_type: &RangedConstraintRelation<OF>,
) -> bool
where
    OF: OrderedField,
    for<'r> &'r OF: OrderedFieldRef<OF>,
{
    match constraint_type {
        RangedConstraintRelation::Equal => {
            right_hand_side == &OF::zero()
        },
        RangedConstraintRelation::Range(range) => {
            right_hand_side >= &OF::zero() && right_hand_side - range <= OF::zero()
        },
        RangedConstraintRelation::Less => {
            right_hand_side >= &OF::zero()
        },
        RangedConstraintRelation::Greater => {
            right_hand_side <= &OF::zero()
        },
    }
}
fn is_empty_constraint_feasible < OF > ( right_hand_side : & OF , constraint_type : & RangedConstraintRelation < OF > , ) -> bool where OF : OrderedField , for < ' r > & ' r OF : OrderedFieldRef < OF > , { match constraint_type { RangedConstraintRelation :: Equal => { right_hand_side == & OF :: zero ( ) } , RangedConstraintRelation :: Range ( range ) => { right_hand_side >= & OF :: zero ( ) && right_hand_side - range <= OF :: zero ( ) } , RangedConstraintRelation :: Less => { right_hand_side >= & OF :: zero ( ) } , RangedConstraintRelation :: Greater => { right_hand_side <= & OF :: zero ( ) } , } }
Whether an empty constraint indicates infeasibility.
Whether an empty constraint indicates infeasibility .
right_hand_side
&OF
constraint_type
&RangedConstraintRelation<OF>
right_hand_side
&OF
constraint_type
&RangedConstraintRelation<OF>