Sensitivity Analysis: Geometric Intuition for Resource Changes

Visualizing how changes in resource availability affect the optimal solution in linear programming through sensitivity analysis.

Visualizing...

Our institutional research engineers are currently mapping the formal proof for Sensitivity Analysis: Geometric Intuition for Resource Changes.

Apply for Institutional Early Access →

The Formal Theorem

Consider a linear programming problem in standard form: Minimize

c^T x

subject to

Ax = b

and

x \ge 0

. Let

x^*

be an optimal solution and

B

be the basis matrix corresponding to

x^*

. If the right-hand side vector

b

is perturbed to

b + \Delta b

, the current optimal solution

x^*

remains optimal for the new problem if and only if the dual feasibility conditions hold for

x^*

with respect to

b + \Delta b

. Specifically, if

x_B^*

is the basic feasible solution associated with

B

and

x_N^* = 0

for the non-basic variables, then for any new right-hand side

b' = b + \Delta b

such that

B^{-1} b' \ge 0

, the original solution

x^*

remains optimal if the reduced costs associated with the original basis

B

remain non-negative (for minimization problems) for the perturbed problem. The range of allowable changes

\Delta b_i

for a specific component

b_i

, while maintaining the current basis

B

as optimal, is determined by the constraints

(B^{-1} (b + \Delta b))_j \ge 0

for all basic variables

j

, and

c_j^T - y^T A_j \ge 0

for all non-basic variables

j

, where

y^T = c_B^T B^{-1}

are the optimal dual variables.

Analytical Intuition.

Imagine a meticulous chef optimizing a recipe for profit. The ingredients (resources) are fixed, and the final dish (production plan) must meet certain dietary needs (constraints). The right-hand side vector

b

represents these dietary requirements – the exact amount of protein, carbs, etc., needed. When

b

changes slightly (e.g., a slight increase in protein demand), we want to know if the chef's current masterpiece remains the most profitable, or if they need to entirely re-engineer the recipe. Sensitivity analysis on the right-hand side tells us the 'sweet spot' for these demands. It reveals how much a specific dietary component can be adjusted before a different set of ingredients (basis variables) becomes more profitable to use, thus changing the optimal recipe entirely. It's like finding the elasticity of profitability with respect to resource availability.

CAUTION

Institutional Warning.

Students often confuse the impact of changes on the objective function coefficients with changes on the right-hand side. The former affects 'how much' we gain, while the latter affects 'what' we can practically achieve.

Academic Inquiries.

What is the primary purpose of analyzing changes in the right-hand side of a linear program?

The primary purpose is to understand the range of feasibility and optimality. It tells us how much the resource availability or demand can change before the current optimal solution becomes infeasible or a different set of decision variables becomes optimal.

How does a change in the right-hand side affect the optimal solution?

A change in the right-hand side can make the current optimal solution infeasible, or it can change the values of the optimal decision variables. If the change is within the 'allowable range,' the optimal basis remains the same, and only the basic variables change their values.

What is an 'allowable increase' or 'allowable decrease' for a right-hand side component?

It is the maximum amount by which a specific component of the right-hand side vector can be increased or decreased, respectively, without changing the optimal basis of the solution.

How is the shadow price related to right-hand side changes?

The shadow price (or dual value) of a constraint represents the rate of change in the optimal objective function value for a unit increase in the right-hand side of that constraint, within its allowable range. It quantifies the marginal value of a resource.

Standardized References.

Definitive Institutional SourceHillier, F. S., & Lieberman, G. J. (2015). Introduction to Operations Research. McGraw-Hill Education.

Foundational

The Convexity of the Feasible Region of a Linear Program

Exploring the cinematic intuition of The Convexity of the Feasible Region of a Linear Program.

Intermediate

The Fundamental Theorem of Linear Programming: Existence of an Optimal Extreme Point Solution

Exploring the cinematic intuition of The Fundamental Theorem of Linear Programming: Existence of an Optimal Extreme Point Solution.

Intermediate

Equivalence of Basic Feasible Solutions and Extreme Points

Exploring the cinematic intuition of Equivalence of Basic Feasible Solutions and Extreme Points.

Advanced

Characterization of Unboundedness in Linear Programming

Exploring the cinematic intuition of Characterization of Unboundedness in Linear Programming.

Institutional Citation

Reference this proof in your academic research or publications.

NICEFA Visual Mathematics. (2026). Sensitivity Analysis: Geometric Intuition for Resource Changes: Visual Proof & Intuition. Retrieved from https://nicefa.org/library/linear-and-integer-programming/sensitivity-analysis-linear-programming-intuition

Dominate the Logic.

"Abstract theory is just a movement we haven't seen yet."

Subscribe for Full Proofs Early Access