Originally posted by: SlavaMedvedev
Thanks Tobias!
I just expected Concert to return something like "Q in constraint is not positive semi-definite" as it does for non-convex objective function minimization. Instead I receive internal exception and don't know what to do.
Now I have two examples again regarding QP problems.
Example1:
dvar boolean x
http://1..5;
maximize
x[1]*x[2] + x[3]*x[4] + x[5]*x[5];
subject to {
x[1] + x[2] + x[3] + x[4] + x[5] <= 3;
}
Works fine!
Example2:
dvar float+ x
http://1..5;
maximize
x[1]*x[2] + x[3]*x[4] + x[5]*x[5];
subject to {
x[1] + x[2] + x[3] + x[4] + x[5] <= 3;
forall (i in 1..5) x[i] <= 1;
}
Error 5002: Q in objective is not positive semi-definite.
Which is strange because I believe the second case is the root relaxation for the first one. Probably the possible reason is that MIP performs "Repairing indefinite Q in the objective."
Does that mean the MIQP supports more widespread space of possible Q in objective???
#CPLEXOptimizers#DecisionOptimization