Linear programs are desirable because the can run relatively quickly and when a solution is found we know the solution to be globally optimal. However, that is not always the case with non$-$linear programs. Under which condition caN you be certain that your solution to a nonlinear program is a global optimal?

a$.$ If all the non$-$linear clements are smooth with no discontinuities.

b$.$ When the solution converges.

C$.$ When you use a generalized reduced gradient algorithm rather than an evolutionary algorithm to solve it$.$

d$.$ When the reasible space is Convex.