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.
Technical Report Dipartimento Informatica e Sistemistica, Sapienza Università di Roma, Vol 1, n.10 (2009).
View Exact Penalty Functions for Nonlinear Integer Programming Problems