Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Auslender, A. (1985), Notes de Cours d'Analyse Numérique, Université Blaise Pascal, Clermont-Ferrand, France, 1985.
Borchardt, M. (1988), An Exact Penalty Approach for Solving a Class of Minimization Problems with Boolean Variables, Optimization 19 (6), 829–838.
Gondran, M. and M., Minoux (1979), Graphes et Algorithmes, Eyrolle, Paris.
Hansen, P., B. Jaumard and V. Mathon (1989), Constrained Nonlinear 0–1 Programming, Rutcor Research Report, # 47–89. 1989.
Kalantari, B. and J. B., Rosen (1987), Penalty Formulation for 0–1 Nonlinear Programming, Discrete Applied Mathematics 16, 179–182.
Pardalos, P. M. and J. B., Rosen (1987), Constrained Global Optimization: Algorithms and Applications, Lecture Notes in Computer Science, 268, Springer-Verlag, Berlin.
Picard, J. C. and H. D., Ratliff (1975), Minimum Cuts and Related Problems, Network 5, 357–370.
Rosenberg, I. (1972), 0–1 Optimization and Nonlinear Programming, Revue Française d'Automatique, Informatique et Recherche Opérationnelle 6, 95–97.
Tuy, H. (1986), A General Deterministic Approach to Global Optimization via D-C Programming, in J. B., Hiriart-Urruty (ed.), Fremat Days 1985: Mathematics for Optimization, North Holland, Amsterdam.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Michelon, P. Unconstrained 0–1 nonlinear programming: A nondifferentiable approach. J Glob Optim 2, 155–165 (1992). https://doi.org/10.1007/BF00122052
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00122052