IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v162y2014i3d10.1007_s10957-013-0482-6.html
   My bibliography  Save this article

Comments on “Enhancements on the Hyperplanes Arrangements in Mixed-Integer Programming Techniques”

Author

Listed:
  • Rubens J. M. Afonso

    (Instituto Tecnológico de Aeronáutica)

  • Roberto K. H. Galvão

    (Instituto Tecnológico de Aeronáutica)

Abstract

In a recent paper by Prodan et al. (J. Optim. Theory Appl. 154:549–572, 2012), a technique was presented to reduce the number of binary variables needed to represent not convex constraints in a mixed-integer programming (MIP) problem. The proposed technique employs tuples of binary variables, which are associated with feasible regions of the feature space. However, since the number of all possible tuples with a given number of bits is a power of two, there may be several unallocated tuples that must be rendered infeasible by imposing suitable constraints. We show in this paper that it is always possible to partition the tuples so that only one inequality is necessary to render all the unallocated tuples and only them infeasible. Moreover, we develop a systematic procedure to perform this partition and write the referred inequality.

Suggested Citation

  • Rubens J. M. Afonso & Roberto K. H. Galvão, 2014. "Comments on “Enhancements on the Hyperplanes Arrangements in Mixed-Integer Programming Techniques”," Journal of Optimization Theory and Applications, Springer, vol. 162(3), pages 996-1003, September.
    • Handle: RePEc:spr:joptap:v:162:y:2014:i:3:d:10.1007_s10957-013-0482-6
    DOI: 10.1007/s10957-013-0482-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-013-0482-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-013-0482-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Ionela Prodan & Florin Stoican & Sorin Olaru & Silviu-Iulian Niculescu, 2012. "Enhancements on the Hyperplanes Arrangements in Mixed-Integer Programming Techniques," Journal of Optimization Theory and Applications, Springer, vol. 154(2), pages 549-572, August.
    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. Joey Huchette & Joey Huchette, 2019. "A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints," Mathematics of Operations Research, INFORMS, vol. 44(3), pages 793-820, August.
    2. Vinícius Antonio Battagello & Nei Yoshihiro Soma & Rubens Junqueira Magalhães Afonso, 2020. "Computational load reduction of the agent guidance problem using Mixed Integer Programming," PLOS ONE, Public Library of Science, vol. 15(6), pages 1-45, June.

    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:spr:joptap:v:162:y:2014:i:3:d:10.1007_s10957-013-0482-6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.