A Boolean Penalty Method for Zero-One Nonlinear Programming

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.

Año de publicación:

2000

Keywords:

• Discrete penalty
• 0-1 nonlinear programming
• Combinatorial optimization

Fuente:

scopus