Question 1

What is Sensitivity Analysis in Linear Programming about?

Accepted Answer

UL = 66.67

 Lower limit
The largest negative number in the Cj-
  Zj row tells how much the profit of x1
  can be decreased before the solution is
  changed

 Lower limit = CV - the largest negative
  value of Cj-Zj/x1 row, cv = 40

therefore, LL = 40 - 15 = 25

So, the range of optimality for C1 is 
   25 ≤ C1 ≤ 66.67

This is the same as obtained by graphical 
method.

Therefore, the range of optimality for the 
coefficient of the basic variable X1 is 
   25 ≤ C1

Question 2

Can I read Sensitivity Analysis in Linear Programming on EtoBox?

Accepted Answer

Sensitivity Analysis in Linear Programming by Rabaa Doorii is a document available to read on EtoBox.

Sensitivity Analysis in Linear Programming

About this book