IDEAS home Printed from https://ideas.repec.org/p/aeg/wpaper/2009-10.html
   My bibliography  Save this paper

Exact Penalty Functions for Nonlinear Integer Programming Problems

Author

Listed:
  • Stefano Lucidi

    (Dipartimento di Informatica e Sistemistica Sapienza Universita' di Roma Via Ariosto, 25 - 00185 Roma - Italy)

  • Francesco Rinaldi

    (Dipartimento di Informatica e Sistemistica Sapienza Universita' di Roma Via Ariosto, 25 - 00185 Roma - Italy)

Abstract

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.

Suggested Citation

  • Stefano Lucidi & Francesco Rinaldi, 2009. "Exact Penalty Functions for Nonlinear Integer Programming Problems," DIS Technical Reports 2009-10, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    • Handle: RePEc:aeg:wpaper:2009-10
    as

    Download full text from publisher

    File URL: http://www.dis.uniroma1.it/~bibdis/RePEc/aeg/wpaper/2009-10.pdf
    File Function: First version, 2009
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Panos M Pardalos & Oleg A Prokopyev & Stanislav Busygin, 2006. "Continuous Approaches for Solving Discrete Optimization Problems," International Series in Operations Research & Management Science, in: Gautam Appa & Leonidas Pitsoulis & H. Paul Williams (ed.), Handbook on Modelling for Discrete Optimization, chapter 0, pages 39-60, Springer.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gary Kochenberger & Jin-Kao Hao & Fred Glover & Mark Lewis & Zhipeng Lü & Haibo Wang & Yang Wang, 2014. "The unconstrained binary quadratic programming problem: a survey," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 58-81, July.
    2. Rupaj Kumar Nayak & Nirmalya Kumar Mohanty, 2020. "Solution of boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation," Journal of Combinatorial Optimization, Springer, vol. 39(3), pages 792-825, April.
    3. Gili Rosenberg & Mohammad Vazifeh & Brad Woods & Eldad Haber, 2016. "Building an iterative heuristic solver for a quantum annealer," Computational Optimization and Applications, Springer, vol. 65(3), pages 845-869, December.
    4. Ma, Cheng & Zhang, Liansheng, 2015. "On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems," Applied Mathematics and Computation, Elsevier, vol. 271(C), pages 642-656.
    5. Sašo Karakatič, 2020. "EvoPreprocess—Data Preprocessing Framework with Nature-Inspired Optimization Algorithms," Mathematics, MDPI, vol. 8(6), pages 1-29, June.
    6. Stefano Lucidi & Francesco Rinaldi, 2010. "An Exact Penalty Global Optimization Approach for Mixed-Integer Programming Problems," DIS Technical Reports 2010-17, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    7. S. Lucidi & F. Rinaldi, 2010. "Exact Penalty Functions for Nonlinear Integer Programming Problems," Journal of Optimization Theory and Applications, Springer, vol. 145(3), pages 479-488, June.
    8. M. Santis & F. Rinaldi, 2012. "Continuous Reformulations for Zero–One Programming Problems," Journal of Optimization Theory and Applications, Springer, vol. 153(1), pages 75-84, April.
    9. Marianna De Santis & Francesco Rinaldi, 2010. "Continuous reformulations for zero-one programming problems," DIS Technical Reports 2010-16, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:aeg:wpaper:2009-10. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Antonietta Angelica Zucconi (email available below). General contact details of provider: https://edirc.repec.org/data/dirosit.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.