My question is my title. I have an LP problem with a finite number of bilinear equality constraints. I know CVX cannot solve it as it is non-convex. Since gurobi solver can solve a bilinear programming problem, can CVX solve bilinear programs with gurobi solver?

No. CVX only models very special convex problems. Try YALMIP.

1 Like