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.
Original language | English |
---|---|
Pages (from-to) | 343-354 |
Number of pages | 12 |
Journal | Journal of Global Optimization |
Volume | 16 |
Issue number | 4 |
DOIs | |
State | Published - Apr 2000 |
Bibliographical note
Funding Information:The authors wish to thank José Koiller for his helpful advice and suggestions. This work was partially supported by CNPq and FAPERJ.
Keywords
- 0-1 nonlinear programming
- Combinatorial optimization
- Discrete penalty