# 7.7 Integer Optimization¶

An optimization problem where one or more of the variables are constrained to integer values is called a (mixed) integer optimization problem. **MOSEK** supports integer variables in combination with linear, quadratic and quadratically constrtained and conic problems (except semidefinite). See the previous tutorials for an introduction to how to model these types of problems.

## 7.7.1 Example MILO1¶

We use the example

to demonstrate how to set up and solve a problem with integer variables. It has the structure of a linear optimization problem (see Sec. 7.1 (Linear Optimization)) except for integrality constraints on the variables. Therefore, only the specification of the integer constraints requires something new compared to the linear optimization problem discussed previously.

First, the integrality constraints are imposed by modifying any existing domain with `Domain.integral`

:

```
x = M.variable('x', 2, Domain.integral(Domain.greaterThan(0.0)))
```

Another way to do this is to use the method `Variable.makeInteger`

on a selected variable.

Next, the example demonstrates how to set various useful parameters of the mixed-integer optimizer. See Sec. 13.4 (The Optimizer for Mixed-Integer Problems) for details.

```
# Set max solution time
M.setSolverParam('mioMaxTime', 60.0)
# Set max relative gap (to its default value)
M.setSolverParam('mioTolRelGap', 1e-4)
# Set max absolute gap (to its default value)
M.setSolverParam('mioTolAbsGap', 0.0)
```

The complete source for the example is listed in Listing 7.12.

## 7.7.2 Specifying an initial solution¶

It is a common strategy to provide a starting feasible point (if one is known in advance) to the mixed-integer solver. This can in many cases reduce solution time.

There are two modes for **MOSEK** to utilize an initial solution.

**A complete solution.****MOSEK**will first try to check if the current value of the primal variable solution is a feasible point. The solution can either come from a previous solver call or can be entered by the user, however the full solution with values for all variables (both integer and continuous) must be provided. This check is always performed and does not require any extra action from the user. The outcome of this process can be inspected via information items`"mioInitialFeasibleSolution"`

and`"mioInitialFeasibleSolutionObj"`

, and via the`Initial feasible solution objective`

entry in the log.**A partial integer solution.****MOSEK**can also try to construct a feasible solution by fixing integer variables to the values provided by the user (rounding if necessary) and optimizing over the remaining continuous variables. In this setup the user must provide initial values for all integer variables. This action is only performed if the parameter`mioConstructSol`

is switched on. The outcome of this process can be inspected via information items`"mioConstructSolution"`

and`"mioConstructSolutionObj"`

, and via the`Construct solution objective`

entry in the log.

In the following example we focus on inputting a partial integer solution.

Solution values can be set using `Variable.setLevel`

.

```
# Assign values to integer variables.
# We only set a slice of xx
init_sol = [1.0, 1.0, 0.0]
x.slice(0,3).setLevel(init_sol)
# Request constructing the solution from integer variable values
M.setSolverParam("mioConstructSol", "on")
```

A more advanced application of `Variable.setLevel`

is presented in the case study on Multiprocessor scheduling.

The log output from the optimizer will in this case indicate that the inputted values were used to construct an initial feasible solution:

```
Construct solution objective : 1.950000000000e+01
```

The same information can be obtained from the API:

```
constr = M.getSolverIntInfo("mioConstructSolution")
constrVal = M.getSolverDoubleInfo("mioConstructSolutionObj")
print("Construct solution utilization: {0}\nConstruct solution objective: {1:.3f}\n".format(constr, constrVal))
```

## 7.7.3 Example MICO1¶

Integer variables can also be used arbitrarily in conic problems (except semidefinite). We refer to the previous tutorials for how to set up a conic optimization problem. Here we present sample code that sets up a simple optimization problem:

The canonical conic formulation of (7.19) suitable for Fusion API for Python is

```
from mosek.fusion import *
with Model('mico1') as M:
x = M.variable(Domain.integral(Domain.unbounded()))
y = M.variable(Domain.integral(Domain.unbounded()))
t = M.variable()
M.constraint(Expr.vstack(t, x, y), Domain.inQCone())
M.constraint(Expr.vstack(Expr.sub(x, 3.8), 1, y), Domain.inPExpCone())
M.objective(ObjectiveSense.Minimize, t)
M.setLogHandler(sys.stdout)
M.solve()
print('Solution: x = {0}, y = {1}'.format(x.level()[0], y.level()[0]))
```

Error and solution status handling were omitted for readability.