A Boolean Penalty Method for Zero-One Nonlinear Programming

David Mauricio, Nelson Maculan

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

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 languageEnglish
Pages (from-to)343-354
Number of pages12
JournalJournal of Global Optimization
Volume16
Issue number4
DOIs
StatePublished - 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

Fingerprint

Dive into the research topics of 'A Boolean Penalty Method for Zero-One Nonlinear Programming'. Together they form a unique fingerprint.

Cite this