I am using the GoldfarbIdnani class to solve a QP problem with linear inequality constraints. However when there is no feasible solution the GoldfarbIdnani class function still provides a solution and has the status Success even though the solution clearly violates the constraints by more than the tolerance.

I used a "brute-force" optimizer which simply checks every possible combination of binding inequality constraints to check that there is no feasible solution.

Attached are the input values I used when calling Minimize().

QP_input.zip