Decison Tree for Optimization Software

The Constrained NLO Problem The Problem: min f(x) subject to h(x)=0, g(x)>=0, n=dim(x), m=dim(g), p=dim(h). The picture shows feasible domain and level sets for f(x)=x1^2+x2^2, g(x)=(x1^2-x2,x2^2-x1) . Infeasible points are shown in dark brown and the levels of f are shown in the feasible domain. You'll find several sections: The LP-problem, also mixed integer and stochastic The QP-problem, also m