Abstract
A column generation method for linear programming problems is described. This method is based on Freund’s shifted barrier method for linear programming. The use of shifts makes it possible to give new primal variables the value zero, with the resulting point being both feasible and interior in the shifted or relaxed formulation. The algorithm takes $O( nL )$ iterations. It is shown that the direction obtained when using the shifted barrier column generation method is related to one proposed by Mitchell and Todd. Preliminary computational results are included, which show that the method may be useful when small numbers of variables are added.
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 callDisclaimer: 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.
