This is a preview. Log in through your library . Abstract Traditional sensitivity analysis of linear programming objective function coefficients concerns itself with variations in single parameters.

Let Ω ⊂ ℝp, p ϵ ℕ* be a nonempty subset and B(Ω) be the Branch lattice of all bounded real functions on a Ω, equipped with sup norm. Let 𝑋 ⊂ 𝐵(Ω) be a linear sublattice of 𝐵(Ω) and 𝐴: 𝑋 → 𝑋 be a ...