What's the dual problem of this quadratic programming problem?

52 Views Asked by At

$$\min\left(\sum_{i=0}^n \sum_{j=0}^n ((V_i)_j)x_ix_j\right)$$ subject to $$x_1 + \dots + x_n = 1,$$ $$m_1x_1 + \dots + m_nx_n = m,$$ $$x_i \ge 0$$