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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.