View Item 
        •   Utrecht University Student Theses Repository Home
        • UU Theses Repository
        • Theses
        • View Item
        •   Utrecht University Student Theses Repository Home
        • UU Theses Repository
        • Theses
        • View Item
        JavaScript is disabled for your browser. Some features of this site may not work without it.

        Browse

        All of UU Student Theses RepositoryBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

        Benders' Decomposition vs.Column & Constraint Generation, a Closer Look

        Thumbnail
        View/Open
        Thesis A Komen Final June 6.pdf (517.6Kb)
        Publication date
        2017
        Author
        Komen, A.
        Metadata
        Show full item record
        Summary
        In this thesis an attempt is made to find out how the type of uncertainty (discrete and finite or polyhedral) in uences performance of Benders' decomposition [4] and Column & Constraint Generation [24] when solving the demand robust location-transportation problem. A generalization of Benders' decomposition is presented to make it applicable to a large group of demand robust optimization problems. Also, Column & Constraint Generation is adapted to be used on discrete and finite uncertainty sets. In [24] it was shown that Column & Constraint Generation is able to solve the problem a lot better than a standard implementation of Benders' decomposition. The performance comparison for discrete and finite uncertainty sets made in this thesis is new. On top of that, a number of techniques for making Benders' faster are applied. Special attention is paid to the role of the MIP-solver that is used as a black box for both algorithms.
        URI
        https://studenttheses.uu.nl/handle/20.500.12932/25971
        Collections
        • Theses
        Utrecht university logo