Skip to main content

LpSensitivity

Struct LpSensitivity 

Source
pub struct LpSensitivity {
    pub basis: Vec<usize>,
    pub x_basic: Vec<f64>,
    pub dual: Vec<f64>,
    pub b_inv: Vec<Vec<f64>>,
}
Expand description

Exact sensitivity analysis for LP in standard form.

For the LP:

min cᵀx s.t. Ax = b, x ≥ 0

at an optimal basic feasible solution with basis B (indices of basic variables), the optimal basic variable values are x_B = B⁻¹ b, and the sensitivity is:

dx_B*/dc_B = -B⁻¹ (from KKT optimality conditions) dx_B*/db = B⁻¹ (from primal feasibility) dx_N*/dc = 0 (nonbasic variables at zero)

Fields§

§basis: Vec<usize>

Optimal basis indices (into the original variable vector).

§x_basic: Vec<f64>

Optimal basic variable values x_B = B⁻¹ b.

§dual: Vec<f64>

Optimal dual variables (shadow prices): y = (B⁻¹)ᵀ c_B.

§b_inv: Vec<Vec<f64>>

Inverse of the basis matrix B⁻¹.

Implementations§

Source§

impl LpSensitivity

Source

pub fn new( a: &[Vec<f64>], b_rhs: &[f64], c: &[f64], basis: Vec<usize>, ) -> OptimizeResult<Self>

Compute LP sensitivity at a given basic feasible solution.

§Arguments
  • a – equality constraint matrix (p×n).
  • b_rhs – equality rhs (p).
  • c – cost vector (n).
  • basis – indices of basic variables (length p).
Source

pub fn dl_dc(&self, n: usize, dl_dx: &[f64]) -> Vec<f64>

Compute dL/dc_B given upstream gradient dL/dx_B.

From the KKT conditions, dx_B*/dc_B = -B⁻¹, so: dL/dc_B_j = -Σ_i (B⁻¹)_{ij} * dL/dx_B_i

§Arguments
  • n – total number of variables.
  • dl_dx – upstream gradient (length n).
Source

pub fn dl_db(&self, dl_dx: &[f64]) -> Vec<f64>

Compute dL/db given upstream gradient dL/dx_B.

From primal feasibility, dx_B*/db = B⁻¹, so: dL/db_k = Σ_i (B⁻¹)_{ik} * dL/dx_B_i

Source

pub fn reduced_costs(&self, a: &[Vec<f64>], c: &[f64]) -> Vec<f64>

Compute reduced costs: c_N - y A_N ≥ 0 at optimality.

Returns a vector of length n with reduced costs for all variables (0 for basic, actual reduced cost for nonbasic).

Trait Implementations§

Source§

impl Clone for LpSensitivity

Source§

fn clone(&self) -> LpSensitivity

Returns a duplicate of the value. Read more
1.0.0 · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for LpSensitivity

Source§

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

Formats the value using the given formatter. Read more

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> 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> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
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 = 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>,

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.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V

Source§

impl<T> Ungil for T
where T: Send,