Abstract
This paper examines special sparsity structures in linear programs that can accelerate calculations in the primal dual method. Our results extend previous research by quantifying more precisely conditions for retaining sparsity during iterations. Special structures that meet these conditions include simple upper bounds, variable upper bounds, and chained upper bounds. We describe an implementation and illustrate the benefits for the uncapacitated facility location problem. INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.
Sign-in/Register to access full text options 
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.
