Exact Penalty Functions for Nonlinear Integer Programming Problems
AbstractIn 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Department of Computer, Control and Management Engineering, Università degli Studi di Roma "La Sapienza" in its series DIS Technical Reports with number 2009-10.
Date of creation: 2009
Date of revision:
nonlinear integer programming; continuous programming; exact penalty functions.;
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Laura Armiero).
If references are entirely missing, you can add them using this form.