Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 9 of 9 for “"Dantzig-Wolfe"”.

  1. Special versus standard algorithms for large-scale harvest scheduling problems

    … over that for the revised simplex method. The Dantzig-Wolfe algorithm is coded and tuned to solve general Model II problems, taking advantage of the Longest Path Algorithm in the subproblem step, and using the revised simplex method to solve the master problems. Computational results show that …

    vt Repository record for Special versus standard algorithms for large-scale harvest scheduling problems (opens in a new tab)

  2. The stochastic air traffic flow management rerouting problem

    … overcome problems with tractability, we apply a Dantzig-Wolfe decomposition and present an efficient method for solving it. The decomposed formulation is shown to be tractable for real-world problem, and it generates up to a ten percent reduction in cost when compared to an otherwise equivalent …

    mit Repository record for The stochastic air traffic flow management rerouting problem (opens in a new tab)

  3. Composite variable formulations for express shipment service network design

    … in a more general setting by presenting it as a Dantzig-Wolfe decomposition of the traditional (intractable) network design formulation and by comparing composite variables to Chvital-Gomory cuts in the dual of a related formulation. Finally, we present a composite variable formulation for the …

    mit Repository record for Composite variable formulations for express shipment service network design (opens in a new tab)

  4. Three Essays On Applied General Equilibrium Analysis

    … and Elasticity Pessimism;" and (3) "A Dantzig-Wolfe Type Decomposition Algorithm for General Equilibrium Models with Applications to International Trade Models.";The first essay discusses various econometric approaches to estimate simple and relatively small GE systems. We discuss both …

    uwo Repository record for Three Essays On Applied General Equilibrium Analysis (opens in a new tab)

  5. Hybrid Solving Techniques for Project Scheduling Problems

    … Abschließend nutzen wir das Konzept der Dantzig-Wolfe Dekomposition, um scharfe Schranken an die Optimallösung von Turnaround Scheduling Problemen zu ermitteln.

    tu-berlin Repository record for Hybrid Solving Techniques for Project Scheduling Problems (opens in a new tab)

  6. Nondifferentiable optimization algorithms with application to solving Lagrangian dual problems

    … mathematical programming approaches such as Dantzig-Wolfe decomposition, Benders decomposition, Lagrangian duality, penalty function methods, and minimax problems. The importance and necessity of having effective solution methods for NDO problems has long been recognized by many scientists …

    vt Repository record for Nondifferentiable optimization algorithms with application to solving Lagrangian dual problems (opens in a new tab)

  7. Planning for Army Force Generation Using Lot Streaming, and Extensions

    As the Army transitions to the Army Force Generation (ARFORGEN) deployment cycle, it must adjust its many operations in support of ARFORGEN. Specifically, the Initial Military Training (IMT) must be able to adjust the scheduling of its classes for newly enlisted service members to finish training …

    vt Repository record for Planning for Army Force Generation Using Lot Streaming, and Extensions (opens in a new tab)

  8. Optimization Methods for Distribution Systems: Market Design and Resiliency Enhancement

    The increasing penetration of proactive agents in distribution systems (DS) has opened new possibilities to make the grid more resilient and to increase participation of responsive loads (RL) and non-conventional generation resources. On the resiliency side, plug-in hybrid electric vehicles (PHEV), …

    vt Repository record for Optimization Methods for Distribution Systems: Market Design and Resiliency Enhancement (opens in a new tab)

  9. MATHEMATICAL PROGRAMMING METHODS FOR PARTIALLY UNDEFINED OPTIMIZATION MODELS

    Questa tesi propone nuovi metodi per formulare e risolvere modelli di programmazione matematica parzialmente indefiniti. Mediante l'utilizzo di metodi di programmazione matematica e solutori per modelli di programmazione lineare e quadratica, puntiamo ad automatizzare il processo di generare …

    milano Repository record for MATHEMATICAL PROGRAMMING METHODS FOR PARTIALLY UNDEFINED OPTIMIZATION MODELS (opens in a new tab)