IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v50y2002i5p810-819.html
   My bibliography  Save this article

On the Value of Binary Expansions for General Mixed-Integer Linear Programs

Author

Listed:
  • Jonathan H. Owen

    (General Motors Research and Development Center, 30500 Mound Road, MC #480-106-359, Warren, Michigan 48090)

  • Sanjay Mehrotra

    (Department of Industrial Engineering and Management Sciences, Robert R. McCormick School of Engineering, Northwestern University, Evanston, Illinois 60208)

Abstract

We study the use of binary variables in reformulating general mixed-integer linear programs. We show that binary reformulations result in problems for which almost all the binary variables replacing a general integer variable need to be explored during branching. We also give computational results on the performance of such reformulations in solving the mixed-integer programs, which support our theoretical results.

Suggested Citation

  • Jonathan H. Owen & Sanjay Mehrotra, 2002. "On the Value of Binary Expansions for General Mixed-Integer Linear Programs," Operations Research, INFORMS, vol. 50(5), pages 810-819, October.
    • Handle: RePEc:inm:oropre:v:50:y:2002:i:5:p:810-819
    DOI: 10.1287/opre.50.5.810.370
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.50.5.810.370
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.50.5.810.370?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
    ---><---

    References listed on IDEAS

    as
    1. Egon Balas & Sebastián Ceria & Gérard Cornuéjols, 1996. "Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework," Management Science, INFORMS, vol. 42(9), pages 1229-1246, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Binyuan Chen & Simge Küçükyavuz & Suvrajeet Sen, 2011. "Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs," Operations Research, INFORMS, vol. 59(1), pages 202-210, February.
    2. Hasmukh Gajjar & Gajendra Adil, 2010. "A piecewise linearization for retail shelf space allocation problem and a local search heuristic," Annals of Operations Research, Springer, vol. 179(1), pages 149-167, September.

    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. John N. Hooker, 2002. "Logic, Optimization, and Constraint Programming," INFORMS Journal on Computing, INFORMS, vol. 14(4), pages 295-321, November.
    2. Alves, Maria Joao & Climaco, Joao, 1999. "Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems," European Journal of Operational Research, Elsevier, vol. 117(3), pages 565-577, September.
    3. Drexl, Andreas & Nissen, Rudiger & Patterson, James H. & Salewski, Frank, 2000. "ProGen/[pi]x - An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions," European Journal of Operational Research, Elsevier, vol. 125(1), pages 59-72, August.
    4. Vipul Jain & Ignacio E. Grossmann, 2001. "Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 13(4), pages 258-276, November.
    5. Egon Balas & Gérard Cornuéjols & Tamás Kis & Giacomo Nannicini, 2013. "Combining Lift-and-Project and Reduce-and-Split," INFORMS Journal on Computing, INFORMS, vol. 25(3), pages 475-487, August.
    6. Eva K. Lee, 2004. "Generating Cutting Planes for Mixed Integer Programming Problems in a Parallel Computing Environment," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 3-26, February.
    7. Lewis Ntaimo, 2010. "Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Random Recourse," Operations Research, INFORMS, vol. 58(1), pages 229-243, February.
    8. André R. S. Amaral, 2008. "An Exact Approach to the One-Dimensional Facility Layout Problem," Operations Research, INFORMS, vol. 56(4), pages 1026-1033, August.
    9. Sebastián Ceria, 2007. "A brief history of lift-and-project," Annals of Operations Research, Springer, vol. 149(1), pages 57-61, February.
    10. Quoc Trung Bui & Yves Deville & Quang Dung Pham, 2016. "Exact methods for solving the elementary shortest and longest path problems," Annals of Operations Research, Springer, vol. 244(2), pages 313-348, September.
    11. R. Andrade & A. Lisser & N. Maculan & G. Plateau, 2005. "B&B Frameworks for the Capacity Expansion of High Speed Telecommunication Networks Under Uncertainty," Annals of Operations Research, Springer, vol. 140(1), pages 49-65, November.
    12. Catanzaro, Daniele & Coniglio, Stefano & Furini, Fabio, 2021. "On the exact separation of cover inequalities of maximum-depth," LIDAM Discussion Papers CORE 2021018, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    13. Egon Balas, 2005. "Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization," Annals of Operations Research, Springer, vol. 140(1), pages 125-161, November.
    14. Kent Andersen & Gérard Cornuéjols & Yanjun Li, 2005. "Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts," Management Science, INFORMS, vol. 51(11), pages 1720-1732, November.
    15. Lawrence C. Leung & Yer Van Hui & Yong Wang & Gang Chen, 2009. "A 0--1 LP Model for the Integration and Consolidation of Air Cargo Shipments," Operations Research, INFORMS, vol. 57(2), pages 402-412, April.
    16. G Appa & D Magos & I Mourtos, 2004. "A Branch & Cut algorithm for a four-index assignment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(3), pages 298-307, March.
    17. Gérard Cornuéjols & Milind Dawande, 1999. "A Class of Hard Small 0-1 Programs," INFORMS Journal on Computing, INFORMS, vol. 11(2), pages 205-210, May.
    18. Jonathan Eckstein & Mikhail Nediak, 2005. "Depth-Optimized Convexity Cuts," Annals of Operations Research, Springer, vol. 139(1), pages 95-129, October.
    19. Gérard Cornuéjols, 2007. "Revival of the Gomory cuts in the 1990’s," Annals of Operations Research, Springer, vol. 149(1), pages 63-66, February.
    20. Amitabh Basu & Robert Hildebrand & Matthias Köppe, 2016. "Light on the infinite group relaxation I: foundations and taxonomy," 4OR, Springer, vol. 14(1), pages 1-40, March.

    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:inm:oropre:v:50:y:2002:i:5:p:810-819. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.