Is there a way to write a quadratic programming problem with
- two variables
- bounded, nonempty feasible region
- linear constraints
and yet have none of the vertices of the region optimize the objective function?
subject to 2x+2y<=10, x,y>=0
The optimal cannot lie on a vertex because then you would be multiplying by 0.