# 6.10 Problem Modification and Reoptimization¶

Often one might want to solve not just a single optimization problem, but a sequence of problems, each differing only slightly from the previous one. This section demonstrates how to modify and re-optimize an existing problem. The example we study is a simple production planning model.

Problem modifications regarding variables, cones, objective function and constraints can be grouped in categories:

• add/remove,
• coefficient modifications,
• bounds modifications.

Especially removing variables and constraints can be costly. Special care must be taken with respect to constraints and variable indexes that may be invalidated.

Depending on the type of modification, MOSEK may be able to optimize the modified problem more efficiently exploiting the information and internal state from the previous execution. After optimization, the solution is always stored internally, and is available before next optimization. The former optimal solution may be still feasible, but no longer optimal; or it may remain optimal if the modification of the objective function was small. This special case is discussed in Sec. 14.3 (Sensitivity Analysis).

In general, MOSEK exploits dual information and availability of an optimal basis from the previous execution. The simplex optimizer is well suited for exploiting an existing primal or dual feasible solution. Restarting capabilities for interior-point methods are still not as reliable and effective as those for the simplex algorithm. More information can be found in Chapter 10 of the book [Chv83].

Parameter settings (see Sec. 7.4 (Setting solver parameters)) can also be changed between optimizations.

## 6.10.1 Example: Production Planning¶

A company manufactures three types of products. Suppose the stages of manufacturing can be split into three parts: Assembly, Polishing and Packing. In the table below we show the time required for each stage as well as the profit associated with each product.

Product no. Assembly (minutes) Polishing (minutes) Packing (minutes) Profit ($) 0 2 3 2 1.50 1 4 2 3 2.50 2 3 3 2 3.00 With the current resources available, the company has $$100,000$$ minutes of assembly time, $$50,000$$ minutes of polishing time and $$60,000$$ minutes of packing time available per year. We want to know how many items of each product the company should produce each year in order to maximize profit? Denoting the number of items of each type by $$x_0,x_1$$ and $$x_2$$, this problem can be formulated as a linear optimization problem: (6.22)$\begin{split}\begin{array}{lcccccll} \mbox{maximize} & 1.5 x_0 & + & 2.5 x_1 & + & 3.0 x_2 & & \\ \mbox{subject to} & 2 x_0 & + & 4 x_1 & + & 3 x_2 & \leq & 100000, \\ & 3 x_0 & + & 2 x_1 & + & 3 x_2 & \leq & 50000, \\ & 2 x_0 & + & 3 x_1 & + & 2 x_2 & \leq & 60000, \end{array}\end{split}$ and $x_0,x_1,x_2 \geq 0.$ Code in Listing 6.37 loads and solves this problem. Listing 6.37 Setting up and solving problem (6.22) Click here to download.  // Since the value infinity is never used, we define // 'infinity' symbolic purposes only double infinity = 0; int numcon = 3; int numvar = 3; double[] c = {1.5, 2.5, 3.0 }; mosek.boundkey[] bkc = {mosek.boundkey.up, mosek.boundkey.up, mosek.boundkey.up }; double[] blc = { -infinity, -infinity, -infinity }; double[] buc = {100000, 50000, 60000 }; mosek.boundkey[] bkx = {mosek.boundkey.lo, mosek.boundkey.lo, mosek.boundkey.lo }; double[] blx = {0.0, 0.0, 0.0 }; double[] bux = { +infinity, +infinity, +infinity }; int[][] asub = new int[numvar][]; asub = new int[] {0, 1, 2}; asub = new int[] {0, 1, 2}; asub = new int[] {0, 1, 2}; double[][] aval = new double[numvar][]; aval = new double[] { 2.0, 3.0, 2.0 }; aval = new double[] { 4.0, 2.0, 3.0 }; aval = new double[] { 3.0, 3.0, 2.0 }; double[] xx = new double[numvar]; mosek.Task task = null; mosek.Env env = null; try { // Create mosek environment. env = new mosek.Env (); // Create a task object linked with the environment env. task = new mosek.Task (env, numcon, numvar); /* Append the constraints. */ task.appendcons(numcon); /* Append the variables. */ task.appendvars(numvar); /* Put C. */ task.putcfix(0.0); for (int j = 0; j < numvar; ++j) task.putcj(j, c[j]); /* Put constraint bounds. */ for (int i = 0; i < numcon; ++i) task.putconbound(i, bkc[i], blc[i], buc[i]); /* Put variable bounds. */ for (int j = 0; j < numvar; ++j) task.putvarbound(j, bkx[j], blx[j], bux[j]); /* Put A. */ if ( numcon > 0 ) { for (int j = 0; j < numvar; ++j) task.putacol(j, asub[j], aval[j]); } task.putobjsense(mosek.objsense.maximize); try { task.optimize(); } catch (mosek.Warning w) { Console.WriteLine("Mosek warning:"); Console.WriteLine (w.Code); Console.WriteLine (w); } task.getxx(mosek.soltype.bas, // Request the basic solution. xx);  ## 6.10.2 Changing the Linear Constraint Matrix¶ Suppose we want to change the time required for assembly of product $$0$$ to $$3$$ minutes. This corresponds to setting $$a_{0,0} = 3$$, which is done by calling the function Task.putaij as shown below.  task.putaij(0, 0, 3.0);  The problem now has the form: (6.23)$\begin{split}\begin{array} {lccccccl} \mbox{maximize} & 1.5 x_0 & + & 2.5 x_1 & + & 3.0 x_2 & & \\ \mbox{subject to} & 3 x_0 & + & 4 x_1 & + & 3 x_2 & \leq & 100000, \\ & 3 x_0 & + & 2 x_1 & + & 3 x_2 & \leq & 50000, \\ & 2 x_0 & + & 3 x_1 & + & 2 x_2 & \leq & 60000, \\ \end{array}\end{split}$ and $x_0,x_1,x_2 \geq 0.$ After this operation we can reoptimize the problem. ## 6.10.3 Appending Variables¶ We now want to add a new product with the following data: Product no. Assembly (minutes) Polishing (minutes) Packing (minutes) Profit ($)
3 4 0 1 1.00

This corresponds to creating a new variable $$x_3$$, appending a new column to the $$A$$ matrix and setting a new term in the objective. We do this in Listing 6.38

Listing 6.38 How to add a new variable (column) Click here to download.
        /********************** Add a new variable ********************/
/* Get index of new variable. */
int varidx;
task.getnumvar(out varidx);

/* Append a new varaible x_3 to the problem */
task.appendvars(1);
numvar++;

/* Set bounds on new varaible */
task.putvarbound(varidx,
mosek.boundkey.lo,
0,
+infinity);

/* Change objective */
task.putcj(varidx, 1.0);

/* Put new values in the A matrix */
int[] acolsub    =  new int[] {0,   2};
double[] acolval =  new double[] {4.0, 1.0};

task.putacol(varidx, /* column index */
acolsub,
acolval);


After this operation the new problem is:

(6.24)$\begin{split}\begin{array}{lccccccccl} \mbox{maximize} & 1.5 x_0 & + & 2.5 x_1 & + & 3.0 x_2 & + & 1.0 x_3 & & \\ \mbox{subject to} & 3 x_0 & + & 4 x_1 & + & 3 x_2 & + & 4 x_3 & \leq & 100000, \\ & 3 x_0 & + & 2 x_1 & + & 3 x_2 & & & \leq & 50000, \\ & 2 x_0 & + & 3 x_1 & + & 2 x_2 & + & 1 x_3 & \leq & 60000, \end{array}\end{split}$

and

$x_0,x_1,x_2,x_3 \geq 0.$

## 6.10.4 Appending Constraints¶

Now suppose we want to add a new stage to the production process called Quality control for which $$30000$$ minutes are available. The time requirement for this stage is shown below:

Product no. Quality control (minutes)
0 1
1 2
2 1
3 1

This corresponds to adding the constraint

$x_0 + 2 x_1 + x_2 + x_3 \leq 30000$

to the problem. This is done as follows.

Listing 6.39 Adding a new constraint. Click here to download.
        /********************** Add a new constraint ********************/
/* Get index of new constraint */
int conidx;
task.getnumcon(out conidx);

/* Append a new constraint */
task.appendcons(1);
numcon++;

/* Set bounds on new constraint */
task.putconbound(conidx,
mosek.boundkey.up,
-infinity,
30000);

/* Put new values in the A matrix */
int[] arowsub = new int[] {0, 1, 2, 3};
double[] arowval = new double[]  {1.0, 2.0, 1.0, 1.0};

task.putarow(conidx, /* row index */
arowsub,
arowval);


Again, we can continue with re-optimizing the modified problem.

## 6.10.5 Changing bounds¶

One typical reoptimization scenario is to change bounds. Suppose for instance that we must operate with limited time resources, and we must change the upper bounds in the problem as follows:

Operation Time available (before) Time available (new)
Assembly 100000 80000
Polishing 50000 40000
Packing 60000 50000
Quality control 30000 22000

That means we would like to solve the problem:

(6.25)$\begin{split}\begin{array}{lccccccccl} \mbox{maximize} & 1.5 x_0 & + & 2.5 x_1 & + & 3.0 x_2 & + & 1.0 x_3 & & \\ \mbox{subject to} & 3 x_0 & + & 4 x_1 & + & 3 x_2 & + & 4 x_3 & \leq & 80000, \\ & 3 x_0 & + & 2 x_1 & + & 3 x_2 & & & \leq & 40000, \\ & 2 x_0 & + & 3 x_1 & + & 2 x_2 & + & 1 x_3 & \leq & 50000, \\ & x_0 & + & 2 x_1 & + & x_2 & + & x_3 & \leq & 22000. \end{array}\end{split}$

In this case all we need to do is redefine the upper bound vector for the constraints, as shown in the next listing.

Listing 6.40 Change constraint bounds. Click here to download.
        /********************** Change constraint bounds ********************/
mosek.boundkey[] newbkc  = {mosek.boundkey.up,
mosek.boundkey.up,
mosek.boundkey.up,
mosek.boundkey.up
};
double[] newblc          = { -infinity,
-infinity,
-infinity,
-infinity
};
double[] newbuc          = { 80000, 40000, 50000, 22000 };

task.putconboundslice(0, numcon, newbkc, newblc, newbuc);


Again, we can continue with re-optimizing the modified problem.

## 6.10.6 Advanced hot-start¶

If the optimizer used the data from the previous run to hot-start the optimizer for reoptimization, this will be indicated in the log:

Optimizer  - hotstart               : yes


When performing re-optimizations, instead of removing a basic variable it may be more efficient to fix the variable at zero and then remove it when the problem is re-optimized and it has left the basis. This makes it easier for MOSEK to restart the simplex optimizer.