IDEAS home Printed from https://ideas.repec.org/a/spr/snopef/v5y2024i3d10.1007_s43069-024-00348-2.html
   My bibliography  Save this article

A Simple Perspective on Simultaneous Column and Row Generation

Author

Listed:
  • Remy Spliet

    (Erasmus University Rotterdam)

Abstract

To solve a linear programming problem with many variables and constraints, a simultaneous column and row generation algorithm can be used. Such an algorithm iteratively solves a restricted version of a linear programming problem including only a subset of the variables and constraints. In each iteration, it might simultaneously add both a new variable and constraint, as opposed to non-simultaneous column and row generation algorithms that only add either a new variable or constraint. In this paper, a simple perspective is provided to indicate the relevance of simultaneous column and row generation and to make it more accessible. Particular emphasis is put on an optimality condition for linear programming which is perhaps a particular source of confusion in this context. It is argued that optimality can be achieved using non-simultaneous column and row generation algorithms, while an example is provided illustrating the potential computational gains of using simultaneous column and row generation algorithms.

Suggested Citation

  • Remy Spliet, 2024. "A Simple Perspective on Simultaneous Column and Row Generation," SN Operations Research Forum, Springer, vol. 5(3), pages 1-11, September.
  • Handle: RePEc:spr:snopef:v:5:y:2024:i:3:d:10.1007_s43069-024-00348-2
    DOI: 10.1007/s43069-024-00348-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s43069-024-00348-2
    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/s43069-024-00348-2?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. Avella, Pasquale & D'Auria, Bernardo & Salerno, Saverio, 2006. "A LP-based heuristic for a time-constrained routing problem," European Journal of Operational Research, Elsevier, vol. 173(1), pages 120-124, August.
    2. Muter, İbrahim & Birbil, Ş. İlker & Bülbül, Kerem, 2018. "Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows," European Journal of Operational Research, Elsevier, vol. 264(1), pages 29-45.
    3. Muter, İbrahim & İlker Birbil, Ş. & Bülbül, Kerem & Şahin, Güvenç, 2012. "A note on “A LP-based heuristic for a time-constrained routing problem”," European Journal of Operational Research, Elsevier, vol. 221(2), pages 306-307.
    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. Dollevoet, Twan & van Essen, J. Theresia & Glorie, Kristiaan M., 2018. "Solution methods for the tray optimization problem," European Journal of Operational Research, Elsevier, vol. 271(3), pages 1070-1084.
    2. Yi Tao & Ek Peng Chew & Loo Hay Lee & Yuran Shi, 2017. "A column generation approach for the route planning problem in fourth party logistics," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(2), pages 165-181, February.
    3. Muter, İbrahim & Sezer, Zeynep, 2018. "Algorithms for the one-dimensional two-stage cutting stock problem," European Journal of Operational Research, Elsevier, vol. 271(1), pages 20-32.
    4. Muter, İbrahim & Birbil, Ş. İlker & Bülbül, Kerem, 2018. "Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows," European Journal of Operational Research, Elsevier, vol. 264(1), pages 29-45.
    5. Stephen J. Maher, 2016. "Solving the Integrated Airline Recovery Problem Using Column-and-Row Generation," Transportation Science, INFORMS, vol. 50(1), pages 216-239, February.
    6. Agustín Montero & Juan José Miranda-Bront & Isabel Méndez-Díaz, 2017. "An ILP-based local search procedure for the VRP with pickups and deliveries," Annals of Operations Research, Springer, vol. 259(1), pages 327-350, December.
    7. Gislaine Mara Melega & Silvio Alexandre de Araujo & Reinaldo Morabito, 2020. "Mathematical model and solution approaches for integrated lot-sizing, scheduling and cutting stock problems," Annals of Operations Research, Springer, vol. 295(2), pages 695-736, December.
    8. Dollevoet, T.A.B. & van Essen, J.T. & Glorie, K.M., 2017. "Solution methods for the tray optimization problem," Econometric Institute Research Papers EI2017-16, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    9. Muter, İbrahim & İlker Birbil, Ş. & Bülbül, Kerem & Şahin, Güvenç, 2012. "A note on “A LP-based heuristic for a time-constrained routing problem”," European Journal of Operational Research, Elsevier, vol. 221(2), pages 306-307.
    10. Wang, Danni & Xiao, Fan & Zhou, Lei & Liang, Zhe, 2020. "Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation," European Journal of Operational Research, Elsevier, vol. 286(2), pages 547-563.

    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:snopef:v:5:y:2024:i:3:d:10.1007_s43069-024-00348-2. 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.