12 Problem Formulation and Solutions

In this chapter we will discuss the following topics:

• The formal, mathematical formulations of the problem types that MOSEK can solve and their duals.

• The solution information produced by MOSEK.

• The infeasibility certificate produced by MOSEK if the problem is infeasible.

For the underlying mathematical concepts, derivations and proofs see the Modeling Cookbook or any book on convex optimization. This chapter explains how the related data is organized specifically within the MOSEK API.

• 12.1 Linear Optimization
• 12.2 Conic Optimization
• 12.3 Semidefinite Optimization
• 12.4 Quadratic and Quadratically Constrained Optimization

Below is an outline of the different problem types for quick reference.

Continuous problem formulations

• Linear optimization (LO)

  \[\begin{split}\begin{array}{lccccl} \mbox{minimize} & & & c^T x+c^f & & \\ \mbox{subject to} & l^c & \leq & A x & \leq & u^c, \\ & l^x & \leq & x & \leq & u^x. \end{array}\end{split}\]

• Conic optimization (CO)

  Conic optimization extends linear optimization with affine conic constraints (ACC):

  \[\begin{split}\begin{array}{lccccl} \mbox{minimize} & & & c^T x+c^f & & \\ \mbox{subject to} & l^c & \leq & A x & \leq & u^c, \\ & l^x & \leq & x & \leq & u^x, \\ & & & Fx+g & \in & \D, \end{array}\end{split}\]

  where \(\D\) is a product of domains from Sec. 15.11 (Supported domains).

• Semidefinite optimization (SDO)

  A conic optimization problem can be further extended with semidefinite variables:

  \[\begin{split}\begin{array}{lccccl} \mbox{minimize} & & & c^T x+ \langle \barC,\barX\rangle + c^f & & \\ \mbox{subject to} & l^c & \leq & A x + \langle \barA,\barX\rangle & \leq & u^c, \\ & l^x & \leq & x & \leq & u^x, \\ & & & Fx+\langle \barF,\barX\rangle +g & \in & \D, \\ & & & \barX & \in & \PSD, \end{array}\end{split}\]

  where \(\D\) is a product of domains from Sec. 15.11 (Supported domains) and \(\PSD\) is a product of PSD cones meaning that \(\barX\) is a sequence of PSD matrix variables.

• Quadratic and quadratically constrained optimization (QO, QCQO)

  A quadratic problem or quadratically constrained problem has the form

  \[\begin{split}\begin{array}{lccccl} \mbox{minimize} & & & \frac12 x^TQ^ox + c^T x+c^f & & \\ \mbox{subject to} & l^c & \leq & \frac12 x^TQ^cx+ A x & \leq & u^c, \\ & l^x & \leq & x & \leq & u^x. \end{array}\end{split}\]

Mixed-integer extensions

Coninuous problems can be extended with constraints requiring the mixed-integer optimizer. We outline them briefly here. The continuous part of a mixed-integer problem is formulated according to one of the continuous types above, however only the primal information and solution fields are relevant, there are no dual values and no infeasibility certificates.

• Integer variables. Specifies that a subset of variables take integer values, that is

  \[x_I \in \integral\]

  for some index set \(I\). Available for problems of type LO, CO, QO and QCQO.

• Disjunctive constraints. Appends disjunctions of the form

  \[\bigvee_{i=1}^t \bigwedge_{j=1}^{s_i} \left(D_{ij}x+d_{ij} \in \mathcal{D}_{ij} \right)\]

  ie. a disjunction of conjunctions of linear constraints, where each \(D_{ij}x+d_{ij}\) is an affine expression of the optimization variables and each \(\D_{ij}\) is an affine domain. Available for problems of type LO and CO.