This document discusses sensitivity analysis for linear programming problems. Sensitivity analysis determines how sensitive the optimal solution is to changes in objective function coefficients (OFCs) and right-hand side (RHS) values of constraints. Graphical and numerical analyses are used to find ranges where the optimal solution does not change with OFC or RHS changes, and to determine shadow prices. The document provides an example problem and discusses how sensitivity analysis can be applied to changes in the problem data.