Answer Happy

Prove that for an optimization problem whose domain C is a convex set and whose constraints 91, 92, ..., Im are convex functions defined on C, the feasibility region {xe C : g(x) <0, ... , gm(x) <0} т is also a convex set.