1
$\begingroup$

Is there a way to write a quadratic programming problem with

  1. two variables
  2. bounded, nonempty feasible region
  3. linear constraints

and yet have none of the vertices of the region optimize the objective function?

  • 1
    consider the squared distance from a point in a square on a plane to a point slightly above the center of the square? (above in the direction orthogonal to the plane)2012-09-29

1 Answers 1

3

Answer:

max xy

subject to 2x+2y<=10, x,y>=0

The optimal cannot lie on a vertex because then you would be multiplying by 0.