Unconstrained 0–1 nonlinear programming: A nondifferentiable approach

✍ Scribed by Philippe Michelon

• Publisher: Springer US
• Year: 1992
• Tongue: English
• Weight: 486 KB
• Volume: 2
• Category: Article
• ISSN: 0925-5001
• DOI: 10.1007/bf00122052

✦ Synopsis

The purpose of this paper is to give new formulations for the unconstrained 0-1 nonlinear problem. The unconstrained 0-1 nonlinear problem is reduced to nonlinear continuous problems where the objective functions are piecewise linear. In the first formulation, the objective function is a difference of two convex functions while the other formulations lead to concave problems. It is shown that the concave problems we obtain have fewer integer local minima than has the classical concave formulation of the 0-1 unconstrained 0-1 nonlinear problem.