udit
Member level 3
I have a basic doubt i.e. What do we mean by a convex mixed integer non linear program?
Does it mean that the continuous relaxation of integer variables in MINLP results in a convex optimization problem
or
We have a Convex optimization problem for each feasible realization of the integer variables
Does it mean that the continuous relaxation of integer variables in MINLP results in a convex optimization problem
or
We have a Convex optimization problem for each feasible realization of the integer variables