# 11.1 Portfolio Optimization¶

In this section the Markowitz portfolio optimization problem and variants are implemented using Optimizer API for .NET.

Familiarity with Sec. 6.2 (From Linear to Conic Optimization) is recommended to follow the syntax used to create affine conic constraints (ACCs) throughout all the models appearing in this case study.

## 11.1.1 The Basic Model¶

The classical Markowitz portfolio optimization problem considers investing in $$n$$ stocks or assets held over a period of time. Let $$x_j$$ denote the amount invested in asset $$j$$, and assume a stochastic model where the return of the assets is a random variable $$r$$ with known mean

$\mu = \mathbf{E} r$

and covariance

$\Sigma = \mathbf{E}(r-\mu)(r-\mu)^T.$

The return of the investment is also a random variable $$y = r^Tx$$ with mean (or expected return)

$\mathbf{E} y = \mu^T x$

and variance

$\mathbf{E}(y - \mathbf{E} y)^2 = x^T \Sigma x.$

The standard deviation

$\sqrt{ x^T \Sigma x }$

is usually associated with risk.

The problem facing the investor is to rebalance the portfolio to achieve a good compromise between risk and expected return, e.g., maximize the expected return subject to a budget constraint and an upper bound (denoted $$\gamma$$) on the tolerable risk. This leads to the optimization problem

(11.1)$\begin{split}\begin{array}{lrcl} \mbox{maximize} & \mu^T x & &\\ \mbox{subject to} & e^T x & = & w + e^T x^0,\\ & x^T \Sigma x & \leq & \gamma^2,\\ & x & \geq & 0. \end{array}\end{split}$

The variables $$x$$ denote the investment i.e. $$x_j$$ is the amount invested in asset $$j$$ and $$x_j^0$$ is the initial holding of asset $$j$$. Finally, $$w$$ is the initial amount of cash available.

A popular choice is $$x^0=0$$ and $$w=1$$ because then $$x_j$$ may be interpreted as the relative amount of the total portfolio that is invested in asset $$j$$.

Since $$e$$ is the vector of all ones then

$e^T x = \sum_{j=1}^{n} x_j$

is the total investment. Clearly, the total amount invested must be equal to the initial wealth, which is

$w + e^T x^0.$

This leads to the first constraint

$e^T x = w + e^T x^0.$

The second constraint

$x^T \Sigma x \leq \gamma^2$

ensures that the variance, is bounded by the parameter $$\gamma^2$$. Therefore, $$\gamma$$ specifies an upper bound of the standard deviation (risk) the investor is willing to undertake. Finally, the constraint

$x_j \geq 0$

excludes the possibility of short-selling. This constraint can of course be excluded if short-selling is allowed.

The covariance matrix $$\Sigma$$ is positive semidefinite by definition and therefore there exist a matrix $$G \in \mathbb{R}^{n\times k}$$ such that

(11.2)$\Sigma = G G^T.$

In general the choice of $$G$$ is not unique and one possible choice of $$G$$ is the Cholesky factorization of $$\Sigma$$. However, in many cases another choice is better for efficiency reasons as discussed in Sec. 11.1.3 (Factor model and efficiency). For a given $$G$$ we have that

$\begin{split}\begin{array}{lll} x^T \Sigma x & = & x^T G G^T x \\ & = & \left\|G^T x\right\|^2. \end{array}\end{split}$

Hence, we may write the risk constraint as

$\gamma \geq \left\|G^T x\right\|$

or equivalently

$(\gamma,G^T x) \in \Q^{k+1},$

where $$\Q^{k+1}$$ is the $$(k+1)$$-dimensional quadratic cone. Note that specifically when $$G$$ is derived using Cholesky factorization, $$k = n$$.

Therefore, problem (11.1) can be written as

(11.3)$\begin{split}\begin{array}{lrcl} \mbox{maximize} & \mu^T x & & \\ \mbox{subject to} & e^T x & = & w+e^T x^0,\\ & (\gamma,G^T x) & \in & \Q^{k+1},\\ & x & \geq & 0, \end{array}\end{split}$

which is a conic quadratic optimization problem that can easily be formulated and solved with Optimizer API for .NET. Subsequently we will use the example data

$\mu = \left[ \begin{array}{cccccccc} 0.0720, 0.1552, 0.1754, 0.0898, 0.4290, 0.3929, 0.3217, 0.1838 \end{array} \right]^T$

and

$\begin{split}\Sigma = \left[ \begin{array}{cccccccc} 0.0946 & 0.0374 & 0.0349 & 0.0348 & 0.0542 & 0.0368 & 0.0321 & 0.0327\\ 0.0374 & 0.0775 & 0.0387 & 0.0367 & 0.0382 & 0.0363 & 0.0356 & 0.0342\\ 0.0349 & 0.0387 & 0.0624 & 0.0336 & 0.0395 & 0.0369 & 0.0338 & 0.0243\\ 0.0348 & 0.0367 & 0.0336 & 0.0682 & 0.0402 & 0.0335 & 0.0436 & 0.0371\\ 0.0542 & 0.0382 & 0.0395 & 0.0402 & 0.1724 & 0.0789 & 0.0700 & 0.0501\\ 0.0368 & 0.0363 & 0.0369 & 0.0335 & 0.0789 & 0.0909 & 0.0536 & 0.0449\\ 0.0321 & 0.0356 & 0.0338 & 0.0436 & 0.0700 & 0.0536 & 0.0965 & 0.0442\\ 0.0327 & 0.0342 & 0.0243 & 0.0371 & 0.0501 & 0.0449 & 0.0442 & 0.0816\\ \end{array} \right].\end{split}$

Using Cholesky factorization, this implies

$\begin{split}G^T = \left[ \begin{array}{cccccccc} 0.3076 & 0.1215 & 0.1134 & 0.1133 & 0.1763 & 0.1197 & 0.1044 & 0.1064\\ 0. & 0.2504 & 0.0995 & 0.0916 & 0.0669 & 0.0871 & 0.0917 & 0.0851\\ 0. & 0. & 0.1991 & 0.0587 & 0.0645 & 0.0737 & 0.0647 & 0.0191\\ 0. & 0. & 0. & 0.2088 & 0.0493 & 0.0365 & 0.0938 & 0.0774\\ 0. & 0. & 0. & 0. & 0.3609 & 0.1257 & 0.1016 & 0.0571\\ 0. & 0. & 0. & 0. & 0. & 0.2155 & 0.0566 & 0.0619\\ 0. & 0. & 0. & 0. & 0. & 0. & 0.2251 & 0.0333\\ 0. & 0. & 0. & 0. & 0. & 0. & 0. & 0.2202\\ \end{array} \right]\end{split}$

In Sec. 11.1.3 (Factor model and efficiency), we present a different way of obtaining $$G$$ based on a factor model, that leads to more efficient computation.

Why a Conic Formulation?

Problem (11.1) is a convex quadratically constrained optimization problem that can be solved directly using MOSEK. Why then reformulate it as a conic quadratic optimization problem (11.3)? The main reason for choosing a conic model is that it is more robust and usually solves faster and more reliably. For instance it is not always easy to numerically validate that the matrix $$\Sigma$$ in (11.1) is positive semidefinite due to the presence of rounding errors. It is also very easy to make a mistake so $$\Sigma$$ becomes indefinite. These problems are completely eliminated in the conic formulation.

Moreover, observe the constraint

$\left\|G^T x\right\| \leq \gamma$

more numerically robust than

$x^T \Sigma x \leq \gamma^2$

for very small and very large values of $$\gamma$$. Indeed, if say $$\gamma \approx 10^4$$ then $$\gamma^2\approx 10^8$$, which introduces a scaling issue in the model. Hence, using conic formulation we work with the standard deviation instead of variance, which usually gives rise to a better scaled model.

Example code

Listing 11.1 demonstrates how the basic Markowitz model (11.3) is implemented.

Listing 11.1 Code implementing problem (11.3). Click here to download.
using System;

namespace mosek.example
{
/* Log handler class */
class msgclass : mosek.Stream
{
string prefix;
public msgclass (string prfx) { prefix = prfx; }

public override void streamCB (string msg)
{
Console.Write ("{0}{1}", prefix, msg);
}
}

public class portfolio_1_basic
{
public static void Main (String[] args)
{
// Since the value infinity is never used, we define
// 'infinity' for symbolic purposes only
double infinity = 0.0;
int n = 8;
double gamma = 36.0;
double[]  mu = {0.07197349, 0.15518171, 0.17535435, 0.0898094 , 0.42895777, 0.39291844, 0.32170722, 0.18378628};
double[,] GT = {
{0.30758, 0.12146, 0.11341, 0.11327, 0.17625, 0.11973, 0.10435, 0.10638},
{0.0,     0.25042, 0.09946, 0.09164, 0.06692, 0.08706, 0.09173, 0.08506},
{0.0,     0.0,     0.19914, 0.05867, 0.06453, 0.07367, 0.06468, 0.01914},
{0.0,     0.0,     0.0,     0.20876, 0.04933, 0.03651, 0.09381, 0.07742},
{0.0,     0.0,     0.0,     0.0,     0.36096, 0.12574, 0.10157, 0.0571 },
{0.0,     0.0,     0.0,     0.0,     0.0,     0.21552, 0.05663, 0.06187},
{0.0,     0.0,     0.0,     0.0,     0.0,     0.0,     0.22514, 0.03327},
{0.0,     0.0,     0.0,     0.0,     0.0,     0.0,     0.0,     0.2202 }
};
int   k = GT.GetLength(0);
double[] x0 = {8.0, 5.0, 3.0, 5.0, 2.0, 9.0, 3.0, 6.0};
double   w = 59;
double   totalBudget;

//Offset of variables into the API variable.
int numvar = n;
int voff_x = 0;

// Constraints offsets
int numcon = 1;
int coff_bud = 0;

// Make mosek environment.
using (mosek.Env env = new mosek.Env())
{
{
// Directs the log task stream

// Holding variable x of length n
// No other auxiliary variables are needed in this formulation

// Setting up variable x
for (int j = 0; j < n; ++j)
{
/* Optionally we can give the variables names */
task.putvarname(voff_x + j, "x[" + (j + 1) + "]");
/* No short-selling - x^l = 0, x^u = inf */
task.putvarbound(voff_x + j, mosek.boundkey.lo, 0.0, infinity);
}

// One linear constraint: total budget
for (int j = 0; j < n; ++j)
{
/* Coefficients in the first row of A */
}
totalBudget = w;
for (int i = 0; i < n; ++i)
{
totalBudget += x0[i];
}

// Input (gamma, GTx) in the AFE (affine expression) storage
// We need k+1 rows
// The first affine expression = gamma
// The remaining k expressions comprise GT*x, we add them row by row
// In more realisic scenarios it would be better to extract nonzeros and input in sparse form
int[] vslice_x = new int[n];
double[] GT_row = new double[n];
for (int i = 0; i < n; ++i)
{
vslice_x[i] = voff_x + i;
}
for (int i = 0; i < k; ++i)
{
for (int j = 0; j < n; ++j) GT_row[j] = GT[i, j];
}

// Input the affine conic constraint (gamma, GT*x) \in QCone

// Objective: maximize expected return mu^T x
for (int j = 0; j < n; ++j)
{
}

/* Display solution summary for quick inspection of results */

double expret = 0.0;
double[] xx = new double[n];

task.getxxslice(mosek.soltype.itr, voff_x, voff_x + n, xx);
for (int j = 0; j < n; ++j)
expret += mu[j] * xx[j + voff_x];

Console.WriteLine("\nExpected return {0:E} for gamma {1:E}", expret, gamma);
}
}
}
}
}


The code is organized as follows:

• We have $$n$$ optimization variables, one per each asset in the portfolio. They correspond to the variable $$x$$ from (11.1) and their indices as variables in the task are from $$0$$ to $$n-1$$ (inclusive).

• The linear part of the problem: budget constraint, no-short-selling bounds and the objective are added in the linear data of the task ($$A$$ matrix, $$c$$ vector and bounds) following the techniques introduced in the tutorial of Sec. 6.1 (Linear Optimization).

• For the quadratic constraint we follow the path introduced in the tutorial of Sec. 6.2 (From Linear to Conic Optimization). We add the vector $$(\gamma, G^Tx)$$ to the affine expression storage (AFE), create a quadratic domain of suitable length, and add the affine conic constraint (ACC) with the selected affine expressions. In the segment

          // Input the affine conic constraint (gamma, GT*x) \in QCone


we use Task.appendaccseq to append a single ACC with the quadratic domain qdom and with a sequence of affine expressions starting at position $$0$$ in the AFE storage and of length equal to the dimension of qdom. This is the simplest way to achieve what we need, since previously we also stored the required rows in AFE in the same order.

## 11.1.2 The Efficient Frontier¶

The portfolio computed by the Markowitz model is efficient in the sense that there is no other portfolio giving a strictly higher return for the same amount of risk. An efficient portfolio is also sometimes called a Pareto optimal portfolio. Clearly, an investor should only invest in efficient portfolios and therefore it may be relevant to present the investor with all efficient portfolios so the investor can choose the portfolio that has the desired tradeoff between return and risk.

Given a nonnegative $$\alpha$$ the problem

(11.4)$\begin{split}\begin{array}{ll} \mbox{maximize} & \mu^T x - \alpha x^T\Sigma x\\ \mbox{subject to} & e^T x = w + e^T x^0,\\ & x \geq 0. \end{array}\end{split}$

is one standard way to trade the expected return against penalizing variance. Note that, in contrast to the previous example, we explicitly use the variance ($$\|G^Tx\|_2^2$$) rather than standard deviation ($$\|G^Tx\|_2$$), therefore the conic model includes a rotated quadratic cone:

(11.5)$\begin{split}\begin{array}{lrcll} \mbox{maximize} & \mu^T x - \alpha s& & &\\ \mbox{subject to} & e^T x & = & w + e^T x^0, &\\ & (s,0.5,G^T x) & \in & Q_r^{k+2} &(\mbox{equiv. to}\ s\geq \|G^Tx\|_2^2 = x^T\Sigma x),\\ & x & \geq & 0. & \end{array}\end{split}$

The parameter $$\alpha$$ specifies the tradeoff between expected return and variance. Ideally the problem (11.4) should be solved for all values $$\alpha \geq 0$$ but in practice it is impossible. Using the example data from Sec. 11.1.1 (The Basic Model), the optimal values of return and variance for several values of $$\alpha$$ are shown in the figure.

Example code

Listing 11.2 demonstrates how to compute the efficient portfolios for several values of $$\alpha$$.

Listing 11.2 Code for the computation of the efficient frontier based on problem (11.4). Click here to download.
namespace mosek.example
{
class msgclass : mosek.Stream
{
string prefix;
public msgclass (string prfx)
{
prefix = prfx;
}

public override void streamCB (string msg)
{
Console.Write ("{0}{1}", prefix, msg);
}
}

public class portfolio_2_frontier
{
public static void Main (String[] args)
{
double infinity = 0;
int n = 8;
double[]   mu = {0.07197, 0.15518, 0.17535, 0.08981, 0.42896, 0.39292, 0.32171, 0.18379};
double[,]  GT = {
{0.30758, 0.12146, 0.11341, 0.11327, 0.17625, 0.11973, 0.10435, 0.10638},
{0.0,     0.25042, 0.09946, 0.09164, 0.06692, 0.08706, 0.09173, 0.08506},
{0.0,     0.0,     0.19914, 0.05867, 0.06453, 0.07367, 0.06468, 0.01914},
{0.0,     0.0,     0.0,     0.20876, 0.04933, 0.03651, 0.09381, 0.07742},
{0.0,     0.0,     0.0,     0.0,     0.36096, 0.12574, 0.10157, 0.0571 },
{0.0,     0.0,     0.0,     0.0,     0.0,     0.21552, 0.05663, 0.06187},
{0.0,     0.0,     0.0,     0.0,     0.0,     0.0,     0.22514, 0.03327},
{0.0,     0.0,     0.0,     0.0,     0.0,     0.0,     0.0,     0.2202 }
};
int   k = GT.GetLength(0);
double[] x0 = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
double   w = 1.0;
double[] alphas = {0.0, 0.01, 0.1, 0.25, 0.30, 0.35, 0.4, 0.45, 0.5, 0.75, 1.0, 1.5, 2.0, 3.0, 10.0};
int numalphas = 15;
double   totalBudget;

// Offset of variables into the API variable.
int numvar = n + 1;
int voff_x = 0;
int voff_s = n;

// Offset of constraints
int coff_bud = 0;

// Make mosek environment.
using (mosek.Env env = new mosek.Env())
{
{
// Directs the log task stream to the user specified
// method msgclass.streamCB

// Setting up variable x
for (int j = 0; j < n; ++j)
{
/* Optionally we can give the variables names */
task.putvarname(voff_x + j, "x[" + (j + 1) + "]");
/* No short-selling - x^l = 0, x^u = inf */
task.putvarbound(voff_x + j, mosek.boundkey.lo, 0.0, infinity);
}

// One linear constraint: total budget
for (int j = 0; j < n; ++j)
{
/* Coefficients in the first row of A */
}
totalBudget = w;
for (int i = 0; i < n; ++i)
{
totalBudget += x0[i];
}

// Input (gamma, GTx) in the AFE (affine expression) storage
// We build the following F and g for variables [x, s]:
//     [0, 1]      [0  ]
// F = [0, 0], g = [0.5]
//     [GT,0]      [0  ]
// We need k+2 rows
// The first affine expression is variable s (last variable, index n)
// The second affine expression is constant 0.5
// The remaining k expressions comprise GT*x, we add them row by row
// In more realisic scenarios it would be better to extract nonzeros and input in sparse form
int[] vslice_x = new int[n];
double[] GT_row = new double[n];
for (int i = 0; i < n; ++i)
{
vslice_x[i] = voff_x + i;
}
for (int i = 0; i < k; ++i)
{
for (int j = 0; j < n; ++j) GT_row[j] = GT[i, j];
}

// Input the affine conic constraint (gamma, GT*x) \in QCone

// Objective: maximize expected return mu^T x
for (int j = 0; j < n; ++j)
{
}

//Turn all log output off.

Console.WriteLine("{0,-15}{1,-15}{2,-15}", "alpha", "exp ret", "std. dev.");

for (int i = 0; i < numalphas; ++i)
{

double expret = 0.0;
double[] xx = new double[numvar];

for (int j = 0; j < n; ++j)
expret += mu[j] * xx[j + voff_x];

Console.WriteLine("{0:E6}  {1:E}  {2:E}", alphas[i], expret, Math.Sqrt(xx[voff_s]));

}
Console.WriteLine("\n");
}
}
}
}
}


Note that we changed the coefficient $$\alpha$$ of the variable $$s$$ in a loop. This way we were able to reuse the same model for all solves along the efficient frontier, simply changing the value of $$\alpha$$ between the solves.

## 11.1.3 Factor model and efficiency¶

In practice it is often important to solve the portfolio problem very quickly. Therefore, in this section we discuss how to improve computational efficiency at the modeling stage.

The computational cost is of course to some extent dependent on the number of constraints and variables in the optimization problem. However, in practice a more important factor is the sparsity: the number of nonzeros used to represent the problem. Indeed it is often better to focus on the number of nonzeros in $$G$$ see (11.2) and try to reduce that number by for instance changing the choice of $$G$$.

In other words if the computational efficiency should be improved then it is always good idea to start with focusing at the covariance matrix. As an example assume that

$\Sigma = D + VV^T$

where $$D$$ is a positive definite diagonal matrix. Moreover, $$V$$ is a matrix with $$n$$ rows and $$k$$ columns. Such a model for the covariance matrix is called a factor model and usually $$k$$ is much smaller than $$n$$. In practice $$k$$ tends to be a small number independent of $$n$$, say less than 100.

One possible choice for $$G$$ is the Cholesky factorization of $$\Sigma$$ which requires storage proportional to $$n(n+1)/2$$. However, another choice is

$\begin{split}G = \left[ \begin{array}{cc} D^{1/2} & V\\ \end{array} \right]\end{split}$

because then

$GG^T = D + VV^T.$

This choice requires storage proportional to $$n+kn$$ which is much less than for the Cholesky choice of $$G$$. Indeed assuming $$k$$ is a constant storage requirements are reduced by a factor of $$n$$.

The example above exploits the so-called factor structure and demonstrates that an alternative choice of $$G$$ may lead to a significant reduction in the amount of storage used to represent the problem. This will in most cases also lead to a significant reduction in the solution time.

The lesson to be learned is that it is important to investigate how the covariance matrix is formed. Given this knowledge it might be possible to make a special choice for $$G$$ that helps reducing the storage requirements and enhance the computational efficiency. More details about this process can be found in [And13].

Factor model in finance

Factor model structure is typical in financial context. It is common to model security returns as the sum of two components using a factor model. The first component is the linear combination of a small number of factors common among a group of securities. The second component is a residual, specific to each security. It can be written as $$R = \sum_j\beta_j F_j + \theta$$, where $$R$$ is a random variable representing the return of a security at a particular point in time, $$F_j$$ is the random variable representing the common factor $$j$$, $$\beta_j$$ is the exposure of the return to factor $$j$$, and $$\theta$$ is the specific component.

Such a model will result in the covariance structure

$\Sigma = \Sigma_\theta + \beta\Sigma_F\beta^T,$

where $$\Sigma_F$$ is the covariance of the factors and $$\Sigma_\theta$$ is the residual covariance. This structure is of the form discussed earlier with $$D = \Sigma_\theta$$ and $$V = \beta P$$, assuming the decomposition $$\Sigma_F = PP^T$$. If the number of factors $$k$$ is low and $$\Sigma_\theta$$ is diagonal, we get a very sparse $$G$$ that provides the storage and solution time benefits.

Example code

Here we will work with the example data of a two-factor model ($$k=2$$) built using the variables

$\begin{split}\beta = \left[ \begin{array}{cc} 0.4256 & 0.1869\\ 0.2413 & 0.3877\\ 0.2235 & 0.3697\\ 0.1503 & 0.4612\\ 1.5325 & -0.2633\\ 1.2741 & -0.2613\\ 0.6939 & 0.2372\\ 0.5425 & 0.2116\\ \end{array} \right],\end{split}$
$\Sigma_\theta = \mathrm{Diag}([0.0720, 0.0508, 0.0377, 0.0394, 0.0663, 0.0224, 0.0417, 0.0459]),$

and the factor covariance matrix is

$\begin{split}\Sigma_F = \left[ \begin{array}{cc} 0.0620 & 0.0577\\ 0.0577 & 0.0908\\ \end{array} \right],\end{split}$

giving

$\begin{split}P = \left[ \begin{array}{cc} 0.2491 & 0. \\ 0.2316 & 0.1928 \\ \end{array} \right].\end{split}$

Then the matrix $$G$$ would look like

$\begin{split}G = \begin{bmatrix} \beta P & \Sigma_\theta^{1/2} \end{bmatrix} = \left[ \begin{array}{cccccccccc} 0.1493 & 0.0360 & 0.2683 & 0. & 0. & 0. & 0. & 0. & 0. & 0.\\ 0.1499 & 0.0747 & 0. & 0.2254 & 0. & 0. & 0. & 0. & 0. & 0.\\ 0.1413 & 0.0713 & 0. & 0. & 0.1942 & 0. & 0. & 0. & 0. & 0.\\ 0.1442 & 0.0889 & 0. & 0. & 0. & 0.1985 & 0. & 0. & 0. & 0.\\ 0.3207 & -0.0508 & 0. & 0. & 0. & 0. & 0.2576 & 0. & 0. & 0.\\ 0.2568 & -0.0504 & 0. & 0. & 0. & 0. & 0. & 0.1497 & 0. & 0.\\ 0.2277 & 0.0457 & 0. & 0. & 0. & 0. & 0. & 0. & 0.2042 & 0.\\ 0.1841 & 0.0408 & 0. & 0. & 0. & 0. & 0. & 0. & 0. & 0.2142\\ \end{array} \right].\end{split}$

This matrix is indeed very sparse.

In general, we get an $$n\times (n+k)$$ size matrix this way with $$k$$ full columns and an $$n\times n$$ diagonal part. Finally we just have to run Listing 11.1 with this $$G$$ matrix.

In the following we demonstrate how to write code to compute the matrix $$G$$ from the factor model. We start with the variables

Listing 11.3 Code for the computation of the matrix $$G$$ from factor model. Click here to download.
      // Factor exposure matrix
double[,] B =
{
{0.4256, 0.1869},
{0.2413, 0.3877},
{0.2235, 0.3697},
{0.1503, 0.4612},
{1.5325, -0.2633},
{1.2741, -0.2613},
{0.6939, 0.2372},
{0.5425, 0.2116}
};

// Factor covariance matrix
double[,] S_F =
{
{0.0620, 0.0577},
{0.0577, 0.0908}
};

// Specific risk components
double[] resid_risk = {0.0720, 0.0508, 0.0377, 0.0394, 0.0663, 0.0224, 0.0417, 0.0459};
double[,] S_theta = diag_matrix(resid_risk);


Then the matrix $$G$$ is obtained:

      double[,] P = cholesky(S_F);
double[,] BP = matrix_mul(B, P);
double[,] G = concat_h(BP, array_sqrt(S_theta));


The functions used above are defined in the source file that can be downloaded from Listing 11.3.

## 11.1.4 Slippage Cost¶

The basic Markowitz model assumes that there are no costs associated with trading the assets and that the returns of the assets are independent of the amount traded. Neither of those assumptions is usually valid in practice. Therefore, a more realistic model is

(11.6)$\begin{split}\begin{array}{lrcl} \mbox{maximize} & \mu^T x & & \\ \mbox{subject to} & e^T x + \sum_{j=1}^{n} T_j(\Delta x_j) & = & w + e^T x^0,\\ & x^T \Sigma x & \leq & \gamma^2,\\ & x & \geq & 0. \end{array}\end{split}$

Here $$\Delta x_j$$ is the change in the holding of asset $$j$$ i.e.

$\Delta x_j = x_j - x_j^0$

and $$T_j(\Delta x_j)$$ specifies the transaction costs when the holding of asset $$j$$ is changed from its initial value. In the next two sections we show two different variants of this problem with two nonlinear cost functions $$T$$.

## 11.1.5 Market Impact Costs¶

If the initial wealth is fairly small and no short selling is allowed, then the holdings will be small and the traded amount of each asset must also be small. Therefore, it is reasonable to assume that the prices of the assets are independent of the amount traded. However, if a large volume of an asset is sold or purchased, the price, and hence return, can be expected to change. This effect is called market impact costs. It is common to assume that the market impact cost for asset $$j$$ can be modeled by

$T_j(\Delta x_j)= m_j |\Delta x_j|^{3/2}$

where $$m_j$$ is a constant that is estimated in some way by the trader. See [GK00] [p. 452] for details. From the Modeling Cookbook we know that $$t \geq |z|^{3/2}$$ can be modeled directly using the power cone $$\POW_3^{2/3,1/3}$$:

$\{(t,z): t \geq |z|^{3/2} \} = \{ (t,z): (t,1,z) \in \POW_3^{2/3,1/3} \}$

Hence, it follows that $$\sum_{j=1}^n T_j(\Delta x_j)=\sum_{j=1}^n m_j|x_j-x_j^0|^{3/2}$$ can be modeled by $$\sum_{j=1}^n m_jt_j$$ under the constraints

$\begin{split}\begin{array}{rl} z_j & = |x_j - x_j^0|, \\ (t_j,1,z_j) & \in \POW_3^{2/3,1/3}. \end{array}\end{split}$

Unfortunately this set of constraints is nonconvex due to the constraint

(11.7)$z_j = |x_j - x_j^0|$

but in many cases the constraint may be replaced by the relaxed constraint

(11.8)$z_j \geq |x_j - x_j^0|,$

For instance if the universe of assets contains a risk free asset then

(11.9)$z_j > |x_j-x_j^0|$

cannot hold for an optimal solution.

If the optimal solution has the property (11.9) then the market impact cost within the model is larger than the true market impact cost and hence money are essentially considered garbage and removed by generating transaction costs. This may happen if a portfolio with very small risk is requested because the only way to obtain a small risk is to get rid of some of the assets by generating transaction costs. We generally assume that this is not the case and hence the models (11.7) and (11.8) are equivalent.

(11.10)$\begin{split}\begin{array}{lrcll} \mbox{maximize} & \mu^T x & & &\\ \mbox{subject to} & e^T x + m^T t & = & w + e^T x^0, &\\ & (\gamma,G^T x) & \in & \Q^{k+1}, & \\ & (t_j,1,x_j-x_j^0) & \in & \POW_3^{2/3,1/3}, & j=1,\ldots,n,\\ & x & \geq & 0. & \end{array}\end{split}$

The revised budget constraint

$e^T x + m^Tt = w + e^T x^0$

specifies that the initial wealth covers the investment and the transaction costs. It should be mentioned that transaction costs of the form

$t_j \geq |z_j|^{p}$

where $$p>1$$ is a real number can be modeled with the power cone as

$(t_j,1,z_j)\in\POW_3^{1/p, 1-1/p}.$

See the Modeling Cookbook for details.

Example code

Listing 11.4 demonstrates how to compute an optimal portfolio when market impact cost are included.

Listing 11.4 Implementation of model (11.10). Click here to download.
using System;

namespace mosek.example {
class msgclass : mosek.Stream
{
string prefix;
public msgclass (string prfx)
{
prefix = prfx;
}

public override void streamCB (string msg)
{
Console.Write ("{0}{1}", prefix, msg);
}
}

public class portfolio_3_impact
{
public static void Main (String[] args)
{
// Since the value infinity is never used, we define
// 'infinity' symbolic purposes only
double infinity = 0;
int n = 8;
double[]   mu = {0.07197, 0.15518, 0.17535, 0.08981, 0.42896, 0.39292, 0.32171, 0.18379};
double[,] GT = {
{0.30758, 0.12146, 0.11341, 0.11327, 0.17625, 0.11973, 0.10435, 0.10638},
{0.0,     0.25042, 0.09946, 0.09164, 0.06692, 0.08706, 0.09173, 0.08506},
{0.0,     0.0,     0.19914, 0.05867, 0.06453, 0.07367, 0.06468, 0.01914},
{0.0,     0.0,     0.0,     0.20876, 0.04933, 0.03651, 0.09381, 0.07742},
{0.0,     0.0,     0.0,     0.0,     0.36096, 0.12574, 0.10157, 0.0571 },
{0.0,     0.0,     0.0,     0.0,     0.0,     0.21552, 0.05663, 0.06187},
{0.0,     0.0,     0.0,     0.0,     0.0,     0.0,     0.22514, 0.03327},
{0.0,     0.0,     0.0,     0.0,     0.0,     0.0,     0.0,     0.2202 }
};
int   k = GT.GetLength(0);
double[] x0 = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
double   w = 1.0;
double gamma = 0.36;
double   totalBudget;

double[] m = new double[n];
for (int i = 0; i < n; ++i)
{
m[i] = 0.01;
}

// Offset of variables into the API variable.
int numvar = 3 * n;
int voff_x = 0;
int voff_c = n;
int voff_z = 2 * n;

// Offset of constraints.
int numcon = 2 * n + 1;
int coff_bud = 0;
int coff_abs1 = 1;
int coff_abs2 = 1 + n;

// Make mosek environment.
using (mosek.Env env = new mosek.Env())
{
{
// Directs the log task stream to the user specified
// method msgclass.streamCB

// Variables (vector of x, c, z)
for (int j = 0; j < n; ++j)
{
/* Optionally we can give the variables names */
task.putvarname(voff_x + j, "x[" + (j + 1) + "]");
task.putvarname(voff_c + j, "c[" + (j + 1) + "]");
task.putvarname(voff_z + j, "z[" + (j + 1) + "]");
/* Apply variable bounds (x >= 0, c and z free) */
task.putvarbound(voff_x + j, mosek.boundkey.lo, 0.0, infinity);
task.putvarbound(voff_c + j, mosek.boundkey.fr, -infinity, infinity);
task.putvarbound(voff_z + j, mosek.boundkey.fr, -infinity, infinity);
}

// Linear constraints
// - Total budget
for (int j = 0; j < n; ++j)
{
/* Coefficients in the first row of A */
}
totalBudget = w;
for (int i = 0; i < n; ++i)
{
totalBudget += x0[i];
}

// - Absolute value
for (int i = 0; i < n; ++i)
{
task.putconname(coff_abs1 + i, "zabs1[" + (1 + i) + "]");
task.putaij(coff_abs1 + i, voff_x + i, -1.0);
task.putaij(coff_abs1 + i, voff_z + i, 1.0);
task.putconbound(coff_abs1 + i, mosek.boundkey.lo, -x0[i], infinity);
task.putconname(coff_abs2 + i, "zabs2[" + (1 + i) + "]");
task.putaij(coff_abs2 + i, voff_x + i, 1.0);
task.putaij(coff_abs2 + i, voff_z + i, 1.0);
task.putconbound(coff_abs2 + i, mosek.boundkey.lo, x0[i], infinity);
}

// ACCs
int aoff_q = 0;
int aoff_pow = k + 1;
// - (gamma, GTx) in Q(k+1)
// The part of F and g for variable x:
//     [0,  0, 0]      [gamma]
// F = [GT, 0, 0], g = [0    ]
int[] vslice_x = new int[n];
double[] GT_row = new double[n];
for (int i = 0; i < n; ++i)
{
vslice_x[i] = voff_x + i;
}
for (int i = 0; i < k; ++i)
{
for (int j = 0; j < n; ++j) GT_row[j] = GT[i, j];
task.putafefrow(aoff_q + i + 1, vslice_x, GT_row);
}

// - (c_j, 1, z_j) in P3(2/3, 1/3)
// The part of F and g for variables [c, z]:
//     [0, I, 0]      
// F = [0, 0, I], g = 
//     [0, 0, 0]      
for (int i = 0; i < n; ++i)
{
task.putafefentry(aoff_pow + i, voff_c + i, 1.0);
task.putafefentry(aoff_pow + n + i, voff_z + i, 1.0);
}
task.putafeg(aoff_pow + 2 * n, 1.0);
// We use one row from F and g for both c_j and z_j, and the last row of F and g for the constant 1.
// NOTE: Here we reuse the last AFE and the power cone n times, but we store them only once.
double[] exponents = {2, 1};
long[] flat_afe_list = new long[3 * n];
long[] dom_list = new long[n];
for (int i = 0; i < n; ++i)
{
flat_afe_list[3 * i + 0] = aoff_pow + i;
flat_afe_list[3 * i + 1] = aoff_pow + 2 * n;
flat_afe_list[3 * i + 2] = aoff_pow + n + i;
dom_list[i] = powdom;
}
for (int i = 0; i < n; ++i)
{
task.putaccname(i + 1, "market_impact[" + i + "]");
}

// Objective: maximize expected return mu^T x
for (int j = 0; j < n; ++j)
{
}

//Turn all log output off.

/* Solve the problem */

double expret = 0.0;
double[] xx = new double[numvar];

for (int j = 0; j < n; ++j)
expret += mu[j] * xx[j + voff_x];

Console.WriteLine("Expected return {0:E6} for gamma {1:E6}\n\n", expret, gamma);
}
}
}
}
}


Note that in the following part of the code:

          task.putafeg(aoff_pow + 2 * n, 1.0);
// We use one row from F and g for both c_j and z_j, and the last row of F and g for the constant 1.
// NOTE: Here we reuse the last AFE and the power cone n times, but we store them only once.
double[] exponents = {2, 1};
long[] flat_afe_list = new long[3 * n];
long[] dom_list = new long[n];
for (int i = 0; i < n; ++i)
{
flat_afe_list[3 * i + 0] = aoff_pow + i;
flat_afe_list[3 * i + 1] = aoff_pow + 2 * n;
flat_afe_list[3 * i + 2] = aoff_pow + n + i;
dom_list[i] = powdom;
}
for (int i = 0; i < n; ++i)
{
task.putaccname(i + 1, "market_impact[" + i + "]");
}


we create a sequence of power cones of the form $$(t_k, 1, x_k-x_k^0)\in \POW_3^{2/3,1/3}$$. The power cones are determined by the sequence of exponents $$(2,1)$$; we create a single domain to account for that.

Moreover, note that the second coordinate of all these affine conic constraints is the same affine expression equal to $$1$$, and we use the feature that allows us to define this affine expression only once (as AFE number aoff_pow + 2 * n) and reuse it in all the ACCs.

## 11.1.6 Transaction Costs¶

Now assume there is a cost associated with trading asset $$j$$ given by

$\begin{split}T_j(\Delta x_j) = \left\lbrace \begin{array}{lll} 0, & \Delta x_j=0, & \\ f_j + g_j |\Delta x_j|,& \mbox{otherwise}. & \end{array}\right.\end{split}$

Hence, whenever asset $$j$$ is traded we pay a fixed setup cost $$f_j$$ and a variable cost of $$g_j$$ per unit traded. Given the assumptions about transaction costs in this section problem (11.6) may be formulated as

(11.11)$\begin{split}\begin{array}{lrcll} \mbox{maximize} & \mu^T x & & &\\ \mbox{subject to} & e^T x + f^Ty + g^T z & = & w + e^T x^0, &\\ & (\gamma,G^T x) & \in & \Q^{k+1}, & \\ & z_j & \geq & x_j - x_j^0, & j=1,\ldots,n,\\ & z_j & \geq & x_j^0 - x_j, & j=1,\ldots,n,\\ & z_j & \leq & U_j y_j, & j=1,\ldots,n,\\ & y_j & \in & \{0,1\}, & j=1,\ldots,n, \\ & x & \geq & 0. & \end{array}\end{split}$

First observe that

$z_j \geq |x_j - x_j^0|=|\Delta x_j|.$

We choose $$U_j$$ as some a priori upper bound on the amount of trading in asset $$j$$ and therefore if $$z_j>0$$ then $$y_j = 1$$ has to be the case. This implies that the transaction cost for asset $$j$$ is given by

$f_j y_j + g_j z_j.$

Example code

The following example code demonstrates how to compute an optimal portfolio when transaction costs are included.

Listing 11.5 Code solving problem (11.11). Click here to download.
using System;

namespace mosek.example {
class msgclass : mosek.Stream
{
string prefix;
public msgclass (string prfx)
{
prefix = prfx;
}

public override void streamCB (string msg)
{
Console.Write ("{0}{1}", prefix, msg);
}
}

public class portfolio_4_transcost
{
public static void Main (String[] args)
{
// Since the value infinity is never used, we define
// 'infinity' symbolic purposes only
double infinity = 0;
int n = 8;
double[]   mu = {0.07197, 0.15518, 0.17535, 0.08981, 0.42896, 0.39292, 0.32171, 0.18379};
double[,] GT = {
{0.30758, 0.12146, 0.11341, 0.11327, 0.17625, 0.11973, 0.10435, 0.10638},
{0.0,     0.25042, 0.09946, 0.09164, 0.06692, 0.08706, 0.09173, 0.08506},
{0.0,     0.0,     0.19914, 0.05867, 0.06453, 0.07367, 0.06468, 0.01914},
{0.0,     0.0,     0.0,     0.20876, 0.04933, 0.03651, 0.09381, 0.07742},
{0.0,     0.0,     0.0,     0.0,     0.36096, 0.12574, 0.10157, 0.0571 },
{0.0,     0.0,     0.0,     0.0,     0.0,     0.21552, 0.05663, 0.06187},
{0.0,     0.0,     0.0,     0.0,     0.0,     0.0,     0.22514, 0.03327},
{0.0,     0.0,     0.0,     0.0,     0.0,     0.0,     0.0,     0.2202 }
};
int   k = GT.GetLength(0);
double[] x0 = {0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0};
double   w = 1.0;
double gamma = 0.36;
double   totalBudget;

double[] f = new double[n];
double[] g = new double[n];
for (int i = 0; i < n; ++i)
{
f[i] = 0.01;
g[i] = 0.001;
}

// Offset of variables.
int numvar = 3 * n;
int voff_x = 0;
int voff_z = n;
int voff_y = 2 * n;

// Offset of constraints.
int numcon = 3 * n + 1;
int coff_bud = 0;
int coff_abs1 = 1;
int coff_abs2 = 1 + n;
int coff_swi = 1 + 2 * n;

// Make mosek environment.
using (mosek.Env env = new mosek.Env())
{
{
// Directs the log task stream to the user specified
// method msgclass.streamCB

// Variables (vector of x, z, y)
for (int j = 0; j < n; ++j)
{
/* Optionally we can give the variables names */
task.putvarname(voff_x + j, "x[" + (j + 1) + "]");
task.putvarname(voff_z + j, "z[" + (j + 1) + "]");
task.putvarname(voff_y + j, "y[" + (j + 1) + "]");
/* Apply variable bounds (x >= 0, z free, y binary) */
task.putvarbound(voff_x + j, mosek.boundkey.lo, 0.0, infinity);
task.putvarbound(voff_z + j, mosek.boundkey.fr, -infinity, infinity);
task.putvarbound(voff_y + j, mosek.boundkey.ra, 0.0, 1.0);
}

// Linear constraints
// - Total budget
for (int j = 0; j < n; ++j)
{
/* Coefficients in the first row of A */
}
double U = w;
for (int i = 0; i < n; ++i)
{
U += x0[i];
}

// - Absolute value
for (int i = 0; i < n; ++i)
{
task.putconname(coff_abs1 + i, "zabs1[" + (1 + i) + "]");
task.putaij(coff_abs1 + i, voff_x + i, -1.0);
task.putaij(coff_abs1 + i, voff_z + i, 1.0);
task.putconbound(coff_abs1 + i, mosek.boundkey.lo, -x0[i], infinity);
task.putconname(coff_abs2 + i, "zabs2[" + (1 + i) + "]");
task.putaij(coff_abs2 + i, voff_x + i, 1.0);
task.putaij(coff_abs2 + i, voff_z + i, 1.0);
task.putconbound(coff_abs2 + i, mosek.boundkey.lo, x0[i], infinity);
}

// - Switch
for (int i = 0; i < n; ++i)
{
task.putconname(coff_swi + i, "switch[" + (1 + i) + "]");
task.putaij(coff_swi + i, voff_z + i, 1.0);
task.putaij(coff_swi + i, voff_y + i, -U);
task.putconbound(coff_swi + i, mosek.boundkey.up, -infinity, 0.0);
}

// ACCs
int aoff_q = 0;
// - (gamma, GTx) in Q(k+1)
// The part of F and g for variable x:
//     [0,  0, 0]      [gamma]
// F = [GT, 0, 0], g = [0    ]
int[] vslice_x = new int[n];
double[] GT_row = new double[n];
for (int i = 0; i < n; ++i)
{
vslice_x[i] = voff_x + i;
}
for (int i = 0; i < k; ++i)
{
for (int j = 0; j < n; ++j) GT_row[j] = GT[i, j];
task.putafefrow(aoff_q + i + 1, vslice_x, GT_row);
}

// Objective: maximize expected return mu^T x
for (int j = 0; j < n; ++j)
{
}
//Turn all log output off.

/* Solve the problem */

double expret = 0.0;
double[] xx = new double[numvar];

for (int j = 0; j < n; ++j)
expret += mu[j] * xx[j + voff_x];

Console.WriteLine("Expected return {0:E6} for gamma {1:E6}\n\n", expret, gamma);
}
}
}
}
}


## 11.1.7 Cardinality constraints¶

Another method to reduce costs involved with processing transactions is to only change positions in a small number of assets. In other words, at most $$K$$ of the differences $$|\Delta x_j|=|x_j - x_j^0|$$ are allowed to be non-zero, where $$K$$ is (much) smaller than the total number of assets $$n$$.

This type of constraint can be again modeled by introducing a binary variable $$y_j$$ which indicates if $$\Delta x_j\neq 0$$ and bounding the sum of $$y_j$$. The basic Markowitz model then gets updated as follows:

(11.12)$\begin{split}\begin{array}{lrcll} \mbox{maximize} & \mu^T x & & &\\ \mbox{subject to} & e^T x & = & w + e^T x^0, &\\ & (\gamma,G^T x) & \in & \Q^{k+1}, & \\ & z_j & \geq & x_j - x_j^0, & j=1,\ldots,n,\\ & z_j & \geq & x_j^0 - x_j, & j=1,\ldots,n,\\ & z_j & \leq & U_j y_j, & j=1,\ldots,n,\\ & y_j & \in & \{0,1\}, & j=1,\ldots,n, \\ & e^T y & \leq & K, & \\ & x & \geq & 0, & \end{array}\end{split}$

were $$U_j$$ is some a priori chosen upper bound on the amount of trading in asset $$j$$.

Example code

The following example code demonstrates how to compute an optimal portfolio with cardinality bounds.

Listing 11.6 Code solving problem (11.12). Click here to download.
    public static double[] markowitz_with_card(int        n,
int        k,
double[]   x0,
double     w,
double     gamma,
double[]   mu,
double[,]  GT,
int        K)
{
// Since the value infinity is never used, we define
// 'infinity' symbolic purposes only
double infinity = 0;

// Offset of variables.
int numvar = 3 * n;
int voff_x = 0;
int voff_z = n;
int voff_y = 2 * n;

// Offset of constraints.
int numcon = 3 * n + 2;
int coff_bud = 0;
int coff_abs1 = 1;
int coff_abs2 = 1 + n;
int coff_swi = 1 + 2 * n;
int coff_card = 1 + 3 * n;

// Make mosek environment.
using (mosek.Env env = new mosek.Env())
{
{
// Directs the log task stream to the user specified
// method msgclass.streamCB

// Variables (vector of x, z, y)
for (int j = 0; j < n; ++j)
{
/* Optionally we can give the variables names */
task.putvarname(voff_x + j, "x[" + (j + 1) + "]");
task.putvarname(voff_z + j, "z[" + (j + 1) + "]");
task.putvarname(voff_y + j, "y[" + (j + 1) + "]");
/* Apply variable bounds (x >= 0, z free, y binary) */
task.putvarbound(voff_x + j, mosek.boundkey.lo, 0.0, infinity);
task.putvarbound(voff_z + j, mosek.boundkey.fr, -infinity, infinity);
task.putvarbound(voff_y + j, mosek.boundkey.ra, 0.0, 1.0);
}

// Linear constraints
// - Total budget
for (int j = 0; j < n; ++j)
{
/* Coefficients in the first row of A */
}
double U = w;
for (int i = 0; i < n; ++i)
{
U += x0[i];
}

// - Absolute value
for (int i = 0; i < n; ++i)
{
task.putconname(coff_abs1 + i, "zabs1[" + (1 + i) + "]");
task.putaij(coff_abs1 + i, voff_x + i, -1.0);
task.putaij(coff_abs1 + i, voff_z + i, 1.0);
task.putconbound(coff_abs1 + i, mosek.boundkey.lo, -x0[i], infinity);
task.putconname(coff_abs2 + i, "zabs2[" + (1 + i) + "]");
task.putaij(coff_abs2 + i, voff_x + i, 1.0);
task.putaij(coff_abs2 + i, voff_z + i, 1.0);
task.putconbound(coff_abs2 + i, mosek.boundkey.lo, x0[i], infinity);
}

// - Switch
for (int i = 0; i < n; ++i)
{
task.putconname(coff_swi + i, "switch[" + (1 + i) + "]");
task.putaij(coff_swi + i, voff_z + i, 1.0);
task.putaij(coff_swi + i, voff_y + i, -U);
task.putconbound(coff_swi + i, mosek.boundkey.up, -infinity, 0.0);
}

// - Cardinality
for (int i = 0; i < n; ++i)
{
}

// ACCs
int aoff_q = 0;
// - (gamma, GTx) in Q(k+1)
// The part of F and g for variable x:
//     [0,  0, 0]      [gamma]
// F = [GT, 0, 0], g = [0    ]
int[] vslice_x = new int[n];
double[] GT_row = new double[n];
for (int i = 0; i < n; ++i)
{
vslice_x[i] = voff_x + i;
}
for (int i = 0; i < k; ++i)
{
for (int j = 0; j < n; ++j) GT_row[j] = GT[i, j];
task.putafefrow(aoff_q + i + 1, vslice_x, GT_row);
}

// Objective: maximize expected return mu^T x
for (int j = 0; j < n; ++j)
{
}
//Turn all log output off.

/* Solve the problem */

double[] xx = new double[n];
task.getxxslice(mosek.soltype.itg, voff_x, voff_x + n, xx);
return xx;
}
}
}


If we solve our running example with $$K=1,\dots,n$$ then we get the following solutions, with increasing expected returns:

Bound 1   Solution: 0.0000e+00   0.0000e+00   1.0000e+00   0.0000e+00   0.0000e+00   0.0000e+00   0.0000e+00   0.0000e+00
Bound 2   Solution: 0.0000e+00   0.0000e+00   3.5691e-01   0.0000e+00   0.0000e+00   6.4309e-01   -0.0000e+00  0.0000e+00
Bound 3   Solution: 0.0000e+00   0.0000e+00   1.9258e-01   0.0000e+00   0.0000e+00   5.4592e-01   2.6150e-01   0.0000e+00
Bound 4   Solution: 0.0000e+00   0.0000e+00   2.0391e-01   0.0000e+00   6.7098e-02   4.9181e-01   2.3718e-01   0.0000e+00
Bound 5   Solution: 0.0000e+00   3.1970e-02   1.7028e-01   0.0000e+00   7.0741e-02   4.9551e-01   2.3150e-01   0.0000e+00
Bound 6   Solution: 0.0000e+00   3.1970e-02   1.7028e-01   0.0000e+00   7.0740e-02   4.9551e-01   2.3150e-01   0.0000e+00
Bound 7   Solution: 0.0000e+00   3.1970e-02   1.7028e-01   0.0000e+00   7.0740e-02   4.9551e-01   2.3150e-01   0.0000e+00
Bound 8   Solution: 1.9557e-10   2.6992e-02   1.6706e-01   2.9676e-10   7.1245e-02   4.9559e-01   2.2943e-01   9.6905e-03