# 15.3 Sensitivity Analysis¶

Given an optimization problem it is often useful to obtain information about how the optimal objective value changes when the problem parameters are perturbed. E.g, assume that a bound represents the capacity of a machine. Now, it may be possible to expand the capacity for a certain cost and hence it is worthwhile knowing what the value of additional capacity is. This is precisely the type of questions the sensitivity analysis deals with.

Analyzing how the optimal objective value changes when the problem data is changed is called sensitivity analysis.

References

The book [Chv83] discusses the classical sensitivity analysis in Chapter 10 whereas the book [RTV97] presents a modern introduction to sensitivity analysis. Finally, it is recommended to read the short paper [Wal00] to avoid some of the pitfalls associated with sensitivity analysis.

Warning

Currently, sensitivity analysis is only available for continuous linear optimization problems. Moreover, MOSEK can only deal with perturbations of bounds and objective function coefficients.

## 15.3.1 Sensitivity Analysis for Linear Problems¶

### 15.3.1.1 The Optimal Objective Value Function¶

Assume that we are given the problem

(1)$\begin{split}\begin{array}{rclccccl} z(l^c,u^c,l^x,u^x,c) & = & \mbox{minimize} & & & c^Tx & & \\ & & \mbox{subject to} & l^c & \leq & Ax & \leq & u^c, \\ & & & l^x & \leq & x & \leq & u^x, \end{array}\end{split}$

and we want to know how the optimal objective value changes as $$l^c_i$$ is perturbed. To answer this question we define the perturbed problem for $$l^c_i$$ as follows

$\begin{split}\begin{array}{rclcccl} f_{l^c_i}(\beta ) & = & \mbox{minimize} & & & c^Tx & \\ & & \mbox{subject to} & l^c + \beta e_i & \leq & Ax & \leq u^c, \\ & & & l^x & \leq & x \leq & u^x, \end{array}\end{split}$

where $$e_i$$ is the $$i$$-th column of the identity matrix. The function

(2)$f_{l^c_i}(\beta)$

shows the optimal objective value as a function of $$\beta$$. Please note that a change in $$\beta$$ corresponds to a perturbation in $$l_i^c$$ and hence (2) shows the optimal objective value as a function of varying $$l^c_i$$ with the other bounds fixed.

It is possible to prove that the function (2) is a piecewise linear and convex function, i.e. its graph may look like in Fig. 2 and Fig. 3.

Fig. 2 $$\beta =0$$ is in the interior of linearity interval.

Fig. 3 $$\beta =0$$ is a breakpoint.

Clearly, if the function $$f_{l^c_i}(\beta )$$ does not change much when $$\beta$$ is changed, then we can conclude that the optimal objective value is insensitive to changes in $$l_i^c$$. Therefore, we are interested in the rate of change in $$f_{l^c_i}(\beta)$$ for small changes in $$\beta$$ — specifically the gradient

$f^\prime_{l^c_i}(0),$

which is called the shadow price related to $$l^c_i$$. The shadow price specifies how the objective value changes for small changes of $$\beta$$ around zero. Moreover, we are interested in the linearity interval

$\beta \in [\beta_1,\beta_2]$

for which

$f^\prime_{l^c_i}(\beta ) = f^\prime_{l^c_i}(0).$

Since $$f_{l^c_i}$$ is not a smooth function $$f^\prime_{l^c_i}$$ may not be defined at $$0$$, as illustrated in Fig. 3. In this case we can define a left and a right shadow price and a left and a right linearity interval.

The function $$f_{l^c_i}$$ considered only changes in $$l^c_i$$. We can define similar functions for the remaining parameters of the $$z$$ defined in (1) as well:

$\begin{split}\begin{array}{rcll} f_{l^c_i}(\beta ) & = & z(l^c+\beta e_i,u^c,l^x,u^x,c), & i=1,\ldots,m, \\ f_{u^c_i}(\beta ) & = & z(l^c,u^c+\beta e_i,l^x,u^x,c), & i=1,\ldots,m, \\ f_{l^x_{j}}(\beta ) & = & z(l^c,u^c,l^x+\beta e_{j},u^x,c), & j=1,\ldots,n, \\ f_{u^x_{j}}(\beta ) & = & z(l^c,u^c,l^x,u^x+\beta e_{j},c), & j=1,\ldots,n, \\ f_{c_{j}}(\beta ) & = & z(l^c,u^c,l^x,u^x,c+\beta e_{j}), & j=1,\ldots,n. \end{array}\end{split}$

Given these definitions it should be clear how linearity intervals and shadow prices are defined for the parameters $$u^c_i$$ etc.

#### 15.3.1.1.1 Equality Constraints¶

In MOSEK a constraint can be specified as either an equality constraint or a ranged constraint. If some constraint $$e_i^c$$ is an equality constraint, we define the optimal value function for this constraint as

$f_{e_i^c}(\beta ) = z(l^c+\beta e_i,u^c+\beta e_i,l^x,u^x,c)$

Thus for an equality constraint the upper and the lower bounds (which are equal) are perturbed simultaneously. Therefore, MOSEK will handle sensitivity analysis differently for a ranged constraint with $$l^c_i = u^c_i$$ and for an equality constraint.

### 15.3.1.2 The Basis Type Sensitivity Analysis¶

The classical sensitivity analysis discussed in most textbooks about linear optimization, e.g. [Chv83], is based on an optimal basic solution or, equivalently, on an optimal basis. This method may produce misleading results [RTV97] but is computationally cheap. Therefore, and for historical reasons, this method is available in MOSEK.

We will now briefly discuss the basis type sensitivity analysis. Given an optimal basic solution which provides a partition of variables into basic and non-basic variables, the basis type sensitivity analysis computes the linearity interval $$[\beta_1,\beta_2]$$ so that the basis remains optimal for the perturbed problem. A shadow price associated with the linearity interval is also computed. However, it is well-known that an optimal basic solution may not be unique and therefore the result depends on the optimal basic solution employed in the sensitivity analysis. This implies that the computed interval is only a subset of the largest interval for which the shadow price is constant. Furthermore, the optimal objective value function might have a breakpoint for $$\beta = 0$$. In this case the basis type sensitivity method will only provide a subset of either the left or the right linearity interval.

In summary, the basis type sensitivity analysis is computationally cheap but does not provide complete information. Hence, the results of the basis type sensitivity analysis should be used with care.

### 15.3.1.3 The Optimal Partition Type Sensitivity Analysis¶

Another method for computing the complete linearity interval is called the optimal partition type sensitivity analysis. The main drawback of the optimal partition type sensitivity analysis is that it is computationally expensive compared to the basis type analysis. This type of sensitivity analysis is currently provided as an experimental feature in MOSEK.

Given the optimal primal and dual solutions to (1), i.e. $$x^*$$ and $$((s_l^c)^*,(s_u^c)^*,(s_l^x)^*,(s_u^x)^*)$$ the optimal objective value is given by

$z^* := c^T x^*.$

The left and right shadow prices $$\sigma_1$$ and $$\sigma_2$$ for $$l_i^c$$ are given by this pair of optimization problems:

$\begin{split}\begin{array} {rclccl} \sigma_1 & = & \mbox{minimize} & e_i^T s_l^c & & \\ & & \mbox{subject to} & A^T (s_l^c-s_u^c) + s_l^x - s_u^x & = & c, \\ & & & (l^c)^T (s_l^c) - (u^c)^T (s_u^c) + (l^x)^T (s_l^x) - (u^x)^T (s_u^x) & = & z^*, \\ & & & s_l^c,s_u^c,s_l^c,s_u^x \geq 0 & & \end{array}\end{split}$

and

$\begin{split}\begin{array} {rclccl} \sigma_2 & = & \mbox{maximize} & e_i^T s_l^c & & \\ & & \mbox{subject to} & A^T (s_l^c-s_u^c) + s_l^x - s_u^x & = & c, \\ & & & (l^c)^T (s_l^c) - (u^c)^T (s_u^c) + (l^x)^T (s_l^x) - (u^x)^T (s_u^x) & = & z^*, \\ & & & s_l^c,s_u^c,s_l^c,s_u^x \geq 0. & & \end{array}\end{split}$

These two optimization problems make it easy to interpret the shadow price. Indeed, if $$((s_l^c)^*,(s_u^c)^*,(s_l^x)^*,(s_u^x)^*)$$ is an arbitrary optimal solution then

$(s_l^c)_i^* \in [\sigma_1,\sigma_2].$

Next, the linearity interval $$[\beta_1,\beta_2]$$ for $$l_i^c$$ is computed by solving the two optimization problems

$\begin{split}\begin{array} {lclccccl} \beta_1 & = & \mbox{minimize} & & & \beta & & \\ & & \mbox{subject to} & l^c + \beta e_i & \leq & Ax & \leq & u^c, \\ & & & & & c^T x - \sigma_1 \beta & = & z^*, \\ & & & l^x & \leq & x & \leq & u^x, \end{array}\end{split}$

and

$\begin{split}\begin{array} {lclccccl} \beta_2 & = & \mbox{maximize} & & & \beta & & \\ & & \mbox{subject to} & l^c + \beta e_i & \leq & Ax & \leq & u^c,\\ & & & & & c^T x - \sigma_2 \beta & = & z^*, \\ & & & l^x & \leq & x & \leq & u^x. \end{array}\end{split}$

The linearity intervals and shadow prices for $$u_i^c,$$ $$l_j^x,$$ and $$u_j^x$$ are computed similarly to $$l_i^c$$.

The left and right shadow prices for $$c_j$$ denoted $$\sigma_1$$ and $$\sigma_2$$ respectively are computed as follows:

$\begin{split}\begin{array} {lclccccl} \sigma_1 & = & \mbox{minimize} & & & e_j^T x & & \\ & & \mbox{subject to} & l^c + \beta e_i & \leq & Ax & \leq & u^c,\\ & & & & & c^T x & = & z^*,\\ & & & l^x & \leq & x & \leq & u^x, \end{array}\end{split}$

and

$\begin{split}\begin{array} {lclccccl} \sigma_2 & = & \mbox{maximize} & & & e_j^T x & & \\ & & \mbox{subject to} & l^c + \beta e_i & \leq & Ax & \leq & u^c,\\ & & & & & c^T x & = & z^*,\\ & & & l^x & \leq & x & \leq & u^x. \end{array}\end{split}$

Once again the above two optimization problems make it easy to interpret the shadow prices. Indeed, if $$x^*$$ is an arbitrary primal optimal solution, then

$x_j^* \in [\sigma_1,\sigma_2].$

The linearity interval $$[\beta_1,\beta_2]$$ for a $$c_j$$ is computed as follows:

$\begin{split}\begin{array} {rclccl} \beta_1 & = & \mbox{minimize} & \beta & & \\ & & \mbox{subject to} & A^T (s_l^c-s_u^c) + s_l^x - s_u^x & = & c + \beta e_j, \\ & & & (l^c)^T (s_l^c) - (u^c)^T (s_u^c) + (l^x)^T (s_l^x) - (u^x)^T (s_u^x) - \sigma_1 \beta & \leq & z^*, \\ & & & s_l^c,s_u^c,s_l^c,s_u^x \geq 0 & & \end{array}\end{split}$

and

$\begin{split}\begin{array} {rclccl} \beta_2 & = & \mbox{maximize} & \beta & & \\ & & \mbox{subject to} & A^T (s_l^c-s_u^c) + s_l^x - s_u^x & = & c + \beta e_j, \\ & & & (l^c)^T (s_l^c) - (u^c)^T (s_u^c) + (l^x)^T (s_l^x) - (u^x)^T (s_u^x) - \sigma_2 \beta & \leq & z^*, \\ & & & s_l^c,s_u^c,s_l^c,s_u^x \geq 0. & & \end{array}\end{split}$

### 15.3.1.4 Example: Sensitivity Analysis¶

As an example we will use the following transportation problem. Consider the problem of minimizing the transportation cost between a number of production plants and stores. Each plant supplies a number of goods and each store has a given demand that must be met. Supply, demand and cost of transportation per unit are shown in Fig. 4.

Fig. 4 Supply, demand and cost of transportation.

If we denote the number of transported goods from location $$i$$ to location $$j$$ by $$x_{ij}$$, problem can be formulated as the linear optimization problem of minimizing

$\begin{array}{ccccccccccccc} 1x_{11} & + & 2x_{12} & + & 5x_{23} & + & 2x_{24} & + & 1x_{31} & + & 2x_{33} & + & 1 x_{34} \end{array}$

subject to

(3)$\begin{split}\begin{array}{ccccccccccccccl} x_{11} & + & x_{12} & & & & & & & & & & & \leq & 400, \\ & & & & x_{23} & + & x_{24} & & & & & & & \leq & 1200, \\ & & & & & & & & x_{31} & + & x_{33} & + & x_{34} & \leq & 1000, \\ x_{11} & & & & & & & + & x_{31} & & & & & = & 800, \\ & & x_{12} & & & & & & & & & & & = & 100, \\ & & & & x_{23} & + & & & & & x_{33} & & & = & 500, \\ & & & & & & x_{24} & + & & & & & x_{34} & = & 500, \\ x_{11}, & & x_{12}, & & x_{23}, & & x_{24}, & & x_{31}, & & x_{33}, & & x_{34} & \geq & 0. \end{array}\end{split}$

The sensitivity parameters are shown in Table 18 and Table 19 for the basis type analysis and in Table 20 and Table 21 for the optimal partition type analysis.

Table 18 Ranges and shadow prices related to bounds on constraints and variables: results for the basis type sensitivity analysis.
Con. $$\beta_1$$ $$\beta_2$$ $$\sigma_1$$ $$\sigma_2$$
$$1$$ $$-300.00$$ $$0.00$$ $$3.00$$ $$3.00$$
$$2$$ $$-700.00$$ $$+\infty$$ $$0.00$$ $$0.00$$
$$3$$ $$-500.00$$ $$0.00$$ $$3.00$$ $$3.00$$
$$4$$ $$-0.00$$ $$500.00$$ $$4.00$$ $$4.00$$
$$5$$ $$-0.00$$ $$300.00$$ $$5.00$$ $$5.00$$
$$6$$ $$-0.00$$ $$700.00$$ $$5.00$$ $$5.00$$
$$7$$ $$-500.00$$ $$700.00$$ $$2.00$$ $$2.00$$
Var. $$\beta_1$$ $$\beta_2$$ $$\sigma_1$$ $$\sigma_2$$
$$x_{11}$$ $$-\infty$$ $$300.00$$ $$0.00$$ $$0.00$$
$$x_{12}$$ $$-\infty$$ $$100.00$$ $$0.00$$ $$0.00$$
$$x_{23}$$ $$-\infty$$ $$0.00$$ $$0.00$$ $$0.00$$
$$x_{24}$$ $$-\infty$$ $$500.00$$ $$0.00$$ $$0.00$$
$$x_{31}$$ $$-\infty$$ $$500.00$$ $$0.00$$ $$0.00$$
$$x_{33}$$ $$-\infty$$ $$500.00$$ $$0.00$$ $$0.00$$
$$x_{34}$$ $$-0.000000$$ $$500.00$$ $$2.00$$ $$2.00$$

Table 19 Ranges and shadow prices related to bounds on constraints and variables: results for the optimal partition type sensitivity analysis.
Con. $$\beta_1$$ $$\beta_2$$ $$\sigma_1$$ $$\sigma_2$$
$$1$$ $$-300.00$$ $$500.00$$ $$3.00$$ $$1.00$$
$$2$$ $$-700.00$$ $$+\infty$$ $$-0.00$$ $$-0.00$$
$$3$$ $$-500.00$$ $$500.00$$ $$3.00$$ $$1.00$$
$$4$$ $$-500.00$$ $$500.00$$ $$2.00$$ $$4.00$$
$$5$$ $$-100.00$$ $$300.00$$ $$3.00$$ $$5.00$$
$$6$$ $$-500.00$$ $$700.00$$ $$3.00$$ $$5.00$$
$$7$$ $$-500.00$$ $$700.00$$ $$2.00$$ $$2.00$$
Var. $$\beta_1$$ $$\beta_2$$ $$\sigma_1$$ $$\sigma_2$$
$$x_{11}$$ $$-\infty$$ $$300.00$$ $$0.00$$ $$0.00$$
$$x_{12}$$ $$-\infty$$ $$100.00$$ $$0.00$$ $$0.00$$
$$x_{23}$$ $$-\infty$$ $$500.00$$ $$0.00$$ $$2.00$$
$$x_{24}$$ $$-\infty$$ $$500.00$$ $$0.00$$ $$0.00$$
$$x_{31}$$ $$-\infty$$ $$500.00$$ $$0.00$$ $$0.00$$
$$x_{33}$$ $$-\infty$$ $$500.00$$ $$0.00$$ $$0.00$$
$$x_{34}$$ $$-\infty$$ $$500.00$$ $$0.00$$ $$2.00$$

Table 20 Ranges and shadow prices related to the objective coefficients: results for the basis type sensitivity analysis.
Var. $$\beta_1$$ $$\beta_2$$ $$\sigma_1$$ $$\sigma_2$$
$$c_1$$ $$-\infty$$ $$3.00$$ $$300.00$$ $$300.00$$
$$c_2$$ $$-\infty$$ $$\infty$$ $$100.00$$ $$100.00$$
$$c_3$$ $$-2.00$$ $$\infty$$ $$0.00$$ $$0.00$$
$$c_4$$ $$-\infty$$ $$2.00$$ $$500.00$$ $$500.00$$
$$c_5$$ $$-3.00$$ $$\infty$$ $$500.00$$ $$500.00$$
$$c_6$$ $$-\infty$$ $$2.00$$ $$500.00$$ $$500.00$$
$$c_7$$ $$-2.00$$ $$\infty$$ $$0.00$$ $$0.00$$

Table 21 Ranges and shadow prices related to the objective coefficients: results for the optimal partition type sensitivity analysis.
Var. $$\beta_1$$ $$\beta_2$$ $$\sigma_1$$ $$\sigma_2$$
$$c_1$$ $$-\infty$$ $$3.00$$ $$300.00$$ $$300.00$$
$$c_2$$ $$-\infty$$ $$\infty$$ $$100.00$$ $$100.00$$
$$c_3$$ $$-2.00$$ $$\infty$$ $$0.00$$ $$0.00$$
$$c_4$$ $$-\infty$$ $$2.00$$ $$500.00$$ $$500.00$$
$$c_5$$ $$-3.00$$ $$\infty$$ $$500.00$$ $$500.00$$
$$c_6$$ $$-\infty$$ $$2.00$$ $$500.00$$ $$500.00$$
$$c_7$$ $$-2.00$$ $$\infty$$ $$0.00$$ $$0.00$$

Examining the results from the optimal partition type sensitivity analysis we see that for constraint number $$1$$ we have $$\sigma_1 = 3,\ \sigma_2=1$$ and $$\beta_1 = -300,\ \beta_2=500$$. Therefore, we have a left linearity interval of $$[-300,0]$$ and a right interval of $$[0,500]$$. The corresponding left and right shadow prices are $$3$$ and $$1$$ respectively. This implies that if the upper bound on constraint $$1$$ increases by

$\beta \in [0,\beta_1] = [0,500]$

then the optimal objective value will decrease by the value

$\sigma_2 \beta = 1 \beta .$

Correspondingly, if the upper bound on constraint $$1$$ is decreased by

$\beta \in [0,300]$

then the optimal objective value will increase by the value

$\sigma_1 \beta = 3 \beta .$

## 15.3.2 Sensitivity Analysis with MOSEK¶

MOSEK provides the functions MSK_primalsensitivity and MSK_dualsensitivity for performing sensitivity analysis. The code in Listing 37 gives an example of its use.

Listing 37 Example of sensitivity analysis with the MOSEK Optimizer API for C. Click here to download.
#include <stdio.h>

#include "mosek.h" /* Include the MOSEK definition file. */

static void MSKAPI printstr(void *handle,
const char str[])
{
printf("%s", str);
} /* printstr */

int main(int argc, char *argv[])
{
const MSKint32t numcon = 7,
numvar = 7;
MSKint32t       i, j;
MSKboundkeye    bkc[] = {MSK_BK_UP, MSK_BK_UP, MSK_BK_UP, MSK_BK_FX,
MSK_BK_FX, MSK_BK_FX, MSK_BK_FX
};
MSKboundkeye    bkx[] = {MSK_BK_LO, MSK_BK_LO, MSK_BK_LO,
MSK_BK_LO, MSK_BK_LO, MSK_BK_LO, MSK_BK_LO
};
MSKint32t       ptrb[] = {0, 2, 4, 6, 8, 10, 12};
MSKint32t       ptre[] = {2, 4, 6, 8, 10, 12, 14};
MSKidxt         sub[] = {0, 3, 0, 4, 1, 5, 1, 6, 2, 3, 2, 5, 2, 6};
MSKrealt        blc[] = { -MSK_INFINITY, -MSK_INFINITY, -MSK_INFINITY, 800, 100, 500, 500};
MSKrealt        buc[] = {400,          1200,         1000,         800, 100, 500, 500};
MSKrealt        c[]   = {1.0, 2.0, 5.0, 2.0, 1.0, 2.0, 1.0};
MSKrealt        blx[] = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
MSKrealt        bux[] = {MSK_INFINITY, MSK_INFINITY, MSK_INFINITY, MSK_INFINITY,
MSK_INFINITY, MSK_INFINITY, MSK_INFINITY
};
MSKrealt        val[] = {1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0};
MSKrescodee     r;

MSKenv_t        env;

/* Create mosek environment. */
r = MSK_makeenv(&env, NULL);

if ( r == MSK_RES_OK )
{
/* Make the optimization task. */

if ( r == MSK_RES_OK )
{
/* Directs the log task stream to the user
specified procedure 'printstr'. */

MSK_STREAM_MSG,
"Defining the problem data.\n");
}

/* Append the constraints. */
if ( r == MSK_RES_OK )

/* Append the variables. */
if ( r == MSK_RES_OK )

/* Put C. */
if ( r == MSK_RES_OK )

if ( r == MSK_RES_OK )
r = MSK_putcslice(task, 0, numvar, c);

/* Put constraint bounds. */
if ( r == MSK_RES_OK )
r = MSK_putconboundslice(task, 0, numcon, bkc, blc, buc);

/* Put variable bounds. */
if ( r == MSK_RES_OK )
r = MSK_putvarboundslice(task, 0, numvar, bkx, blx, bux);

/* Put A. */
if ( r == MSK_RES_OK )
r = MSK_putacolslice(task, 0, numvar, ptrb, ptre, sub, val);

if ( r == MSK_RES_OK )

if ( r == MSK_RES_OK )

if ( r == MSK_RES_OK )
{
/* Analyze upper bound on c1 and the equality constraint on c4 */
MSKidxt subi[]  = {0, 3};
MSKmarke marki[] = {MSK_MARK_UP, MSK_MARK_UP};

/* Analyze lower bound on the variables x12 and x31 */
MSKidxt subj[]  = {1, 4};
MSKmarke markj[] = {MSK_MARK_LO, MSK_MARK_LO};

MSKrealt leftpricei[2];
MSKrealt rightpricei[2];
MSKrealt leftrangei[2];
MSKrealt rightrangei[2];
MSKrealt leftpricej[2];
MSKrealt rightpricej[2];
MSKrealt leftrangej[2];
MSKrealt rightrangej[2];

2,
subi,
marki,
2,
subj,
markj,
leftpricei,
rightpricei,
leftrangei,
rightrangei,
leftpricej,
rightpricej,
leftrangej,
rightrangej);

printf("Results from sensitivity analysis on bounds:\n");

printf("For constraints:\n");
for (i = 0; i < 2; ++i)
printf("leftprice = %e, rightprice = %e,leftrange = %e, rightrange =%e\n",
leftpricei[i], rightpricei[i], leftrangei[i], rightrangei[i]);

printf("For variables:\n");
for (i = 0; i < 2; ++i)
printf("leftprice = %e, rightprice = %e,leftrange = %e, rightrange =%e\n",
leftpricej[i], rightpricej[i], leftrangej[i], rightrangej[i]);
}

if ( r == MSK_RES_OK )
{
MSKint32t subj[]  = {2, 5};
MSKrealt  leftprice[2];
MSKrealt  rightprice[2];
MSKrealt  leftrange[2];
MSKrealt  rightrange[2];

2,
subj,
leftprice,
rightprice,
leftrange,
rightrange
);

printf("Results from sensitivity analysis on objective coefficients:\n");

for (i = 0; i < 2; ++i)
printf("leftprice = %e, rightprice = %e,leftrange = %e, rightrange =%e\n",
leftprice[i], rightprice[i], leftrange[i], rightrange[i]);
}