Exact Penalty Functions for Nonlinear Integer Programming Problems

In this work, we study exact continuous reformulations of nonlinear integer programming problems. To this aim, we preliminarily state conditions to guarantee the equivalence between pairs of general nonlinear problems. Then, we prove that optimal solutions of a nonlinear integer programming problem...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of optimization theory and applications Ročník 145; číslo 3; s. 479 - 488
Hlavní autori: Lucidi, S., Rinaldi, F.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Boston Springer US 01.06.2010
Springer
Springer Nature B.V
Predmet:
Applications of Mathematics
Applied sciences
Calculus of Variations and Optimal Control; Optimization
Engineering
Exact sciences and technology
Integer programming
Linear programming
Mathematical programming
Mathematics
Mathematics and Statistics
Operational research and scientific management
Operational research. Management science
Operations Research/Decision Theory
Optimization
Studies
Theory of Computation
Exact penalty functions
Nonlinear integer programming
Continuous programming
Integer programming
Penalty function
Non linear programming
Penalty method
ISSN:0022-3239, 1573-2878
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this work, we study exact continuous reformulations of nonlinear integer programming problems. To this aim, we preliminarily state conditions to guarantee the equivalence between pairs of general nonlinear problems. Then, we prove that optimal solutions of a nonlinear integer programming problem can be obtained by using various exact penalty formulations of the original problem in a continuous space.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0022-3239
1573-2878
DOI:10.1007/s10957-010-9700-7