An Exact Penalty Approach for Mixed Integer Nonlinear Programming Problems
We propose an exact penalty approach for solving mixed integer nonlinear programming (MINLP) problems by converting a general MINLP problem to a finite sequence of nonlinear programming (NLP) problems with only continuous variables. We express conditions of exactness for MINLP problems and show how...
Gespeichert in:
Veröffentlicht in: | American journal of operations research 2011-09, Vol.1 (3), p.185-189 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | We propose an exact penalty approach for solving mixed integer nonlinear programming (MINLP) problems by converting a general MINLP problem to a finite sequence of nonlinear programming (NLP) problems with only continuous variables. We express conditions of exactness for MINLP problems and show how the exact penalty approach can be extended to constrained problems. |
---|---|
ISSN: | 2160-8830 2160-8849 |
DOI: | 10.4236/ajor.2011.13021 |