A Boolean Penalty Method for Zero-One Nonlinear Programming

Authors:
David Mauricio;Nelson Maculan
Affiliations:
State University of Norte Fluminense (UENF), Laboratory of Science and Engineering –/ CCT, Av. Alberto Lamego, 2000 Campos, RJ 28015-620, Brazil (e-mail: mauricio@uenf.br)/;Systems Engineering and Computer Science, COPPE –/ Federal University of Rio de Janeiro, P.O. Box 68511, Rio de Janeiro, RJ 21945-970, Brazil (e-mail: maculan@cos.ufrj.br)
Venue:
Journal of Global Optimization
Year:
2000

Citing 5
Cited 2

A subgradient algorithm for nonlinear integer programming and its parallel implementation

A subgradient algorithm for nonlinear integer programming and its parallel implementation
Solving mixed integer nonlinear programs by outer approximation

Mathematical Programming: Series A and B
Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities

Mathematical Programming: Series A and B
New variants of bundle methods

Mathematical Programming: Series A and B
Branch and bound experiments in nonlinear integer programming

Branch and bound experiments in nonlinear integer programming

A Sequential Ascending Parameter Method for Solving Constrained Minimization Problems

SIAM Journal on Optimization
Exactness and algorithm of an objective penalty function

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a discrete penalty called Boolean Penalty to 0–1 constrained nonlinear programming (PNLC-01). The main importance of this Penalty function are its properties which allow us to develop algorithms for the PNLC-01 problem. Optimality conditions, and numerical results are presented.