Abstract
We develop a factored basis inverse for linear programming problems with generalized upper bound (GUB) constraints. The method allows both +1's and −1's in inequality GUB constraints. We then present a dynamic factorization GUB algorithm that seeks to reduce the size of the working inverse. Finally, a comparison of algorithms used to locate GUB structures is mentioned.
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.
