Unconstrained 0-1 nonlinear programming: A nondifferentiable approach (Q1187840): Difference between revisions

The unconstrained 0-1 nonlinear programming problem is reduced to a nonlinear continuous problem where the objective function is piecewise linear. In the first formulation the objective function is the difference of two convex functions. In the other two formulations one gets concave problems having fewer integer local minima than by reduction in a classical way.