Return to Revisions

2 of 2

Added tag to question

edit approved Dec 27, 2016 at 9:38

2.7k
3
18
37

Nonconvex optimization problem

I have a nonconvex optimization problem with a linear objective function, a set of linear constraints and a set of nonlinear, non-convex constraints. Is this problem NP-hard? If so, how can I prove this?

nonlinear-optimization non-convex-optimization

asked Jul 3, 2013 at 11:34

Star