Example of a quadratic programming problem with no optimal solution on vertices?

1.7k Views Asked by At

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

There are 1 best solutions below

0
On BEST ANSWER

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.