0
votes
0answers
26 views

Total unimodularity in quadratic programming.

I have a quadratic integer problem of the following form: \begin{align} minimize & \quad \tfrac{1}{2} x^T Q x + c^T x \\ subject \ to & \quad M x = 1 \\ & \quad x_i \in \{0, 1\} ...
0
votes
0answers
21 views

Question concerning quadratic programming

Consider a quadratic program where you are given a polyhedron Ax <= b And you are given an arbitrary point F such that you want to maximize the distance from this point and you are guaranteed the ...
3
votes
1answer
898 views

what is the computational complexity of solving a quadratic program with linear inequality constraints

I'm aware of several solution methods and have several solvers at my disposal, but I can't for the life of me find analysis on the complexity. In particular, I'm interested in the complexity of ...