Skip to main content

ConstraintSensitivity

Struct ConstraintSensitivity 

Source
#[non_exhaustive]
pub struct ConstraintSensitivity { pub shadow_price: Rational, pub slack: Rational, pub binding: bool, pub rhs_range: Interval, pub redundant: bool, pub source: Option<Source>, }
Expand description

Sensitivity of one constraint.

Fields (Non-exhaustive)§

This struct is marked as non-exhaustive
Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.
§shadow_price: Rational

Shadow price y_i: the change of the optimal objective per unit increase of the right-hand side b_i, valid while b_i stays within rhs_range.

This is the rate of change of z itself (as in Hillier & Lieberman or Excel), so it is positive when raising b_i increases z, also when minimizing. LINDO’s “dual price” is the improvement instead: the same value when maximizing, negated when minimizing.

§slack: Rational

Unused amount at the optimum: b_i - a_i x for <=, a_i x - b_i for >=, and 0 for =.

§binding: bool

The constraint holds with equality at the optimum (slack == 0).

§rhs_range: Interval

Values of b_i (all else equal) for which the final basis stays feasible, hence optimal, with the same shadow prices. A free variable may change sign inside the range (its two columns trade places, which keeps the prices). A single point [b_i, b_i] for a redundant equality and for the equalities it depends on: moving any of them alone makes the constraints inconsistent.

§redundant: bool

An equality that is a linear combination of other constraints, removed from the basis. Its shadow price is reported as 0 (it is not unique), and its right-hand side cannot change alone without making the problem infeasible.

§source: Option<Source>

Where the shadow price can be read in the final tableau, if anywhere.

Trait Implementations§

Source§

impl Clone for ConstraintSensitivity

Source§

fn clone(&self) -> Self

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for ConstraintSensitivity

Source§

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

Formats the value using the given formatter. Read more
Source§

impl<'de> Deserialize<'de> for ConstraintSensitivity

Source§

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>
where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
Source§

impl Eq for ConstraintSensitivity

Source§

impl PartialEq for ConstraintSensitivity

Source§

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

Equality operator ==. Read more
1.0.0 (const: unstable) · Source§

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

Inequality operator !=. Read more
Source§

impl Serialize for ConstraintSensitivity

Source§

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>
where __S: Serializer,

Serialize this value into the given Serde serializer. Read more
Source§

impl StructuralPartialEq for ConstraintSensitivity

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> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> DeserializeOwned for T
where T: for<'de> Deserialize<'de>,

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> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

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

Source§

type Error = !

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

fn try_from(value: U) -> Result<T, !>

Performs the conversion.
Source§

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

Source§

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.