# 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?

• As @Brian Borchers says in his answer, this is impossible to answer without seeing the problem. – Igor Rivin Jul 5 '13 at 3:35