Return to Question

Added tag to question

edit approved Dec 27, 2016 at 9:38

2.7k
3
18
37

I have a nonconvexnonconvex optimization problem. It is actually optimizing with a linearlinear objective function over, a set of linearlinear constraints and a set of nonlinear, non convex-convex constraints.

Is this problem NP-hard? If so, hawhow can I prove this?

Source Link

asked Jul 3, 2013 at 11:34

Star

Nonconvex optimization problem

I have a nonconvex optimization problem. It is actually optimizing a linear objective function over a set of linear constraints and a set of nonlinear, non convex constraints.

Is this problem NP-hard? If so, haw can I prove this?

linear-programming convex-optimization nonlinear-optimization