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 20 of 54 for “"Dantzig-Wolfe"”.
-
Distributed optimization of linear programs using Dantzig-Wolfe decomposition
… computers. Our approach is based on the Dantzig-Wolfe decomposition algorithm. In a Dantzig-Wolfe decomposition, a block-angular linear program with R blocks is decomposed into R+1 semi-autonomous processes. One of them is the coordinating process which generates prices, and the remaining …
-
Documentation of decomp: A dantzig-wolfe decomposition code for linear programming
… of DECOMP, an implementation of the Dantzig-Wolfe decomposition algorithm for solving block angular linear programming problems based on the scheme of Ho and Loute (1981).</p> <p>We first present the specifications that must be met by any robust implementation of linear programming …
-
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 …
-
Árvores capacitadas
… thesis we investigate some problems related to Dantzig-Wolfe reformulation suggested to the CMSTP. Indeed, we study same variants of the column generation problems relative to such reformulations. In this process, we propose formulations and algorithms for exact and heuristic solutions to the …
-
Novel formulation and decomposition-based optimization for strategic supply chain management under uncertainty
… the decomposable structure of the formulation, Dantzig-Wolfe decomposition is studied in the thesis. Two approaches to implement Dantzig-Wolfe decomposition are developed, and both approaches involve the solution of a sequence of linear programming (LP) and mixed-integer linear programming …
-
Algorithms for the Bi-objective Multi-commodity Minimum Cost Flow Problem
… algorithm for solving the problem by integrating Dantzig-Wolfe decomposition in the iterations of the bi-objective simplex algorithm. Our algorithm is the rst application of Dantzig-Wolfe decomposition to multi-objective network ow problems. The algorithm solves the problem by reformulating it as …
-
A Distributed Linear Programming Model in a Smart Grid
… a Smart grid. I have implemented and tested the Dantzig-Wolfe decomposition process in standard IEEE 14-bus and 30-bus systems. The dissertation provides details about how to formulate, implement, and test such an LP-based design to study the dynamic behavior and impact of an electrical network …
-
Modelos e métodos para problemas de dimensionamento de lotes e escalonamento
… da aplicação dos princípios da decomposição de Dantzig-Wolfe múltipla a uma formulação de programação inteira mista para o problema. Os princípios gerais de aplicação desta decomposição são também apresentados neste trabalho. A potencial mais valia deste modelo relaciona-se com a obtenção de …
-
Decomposition Methods in Column Generation and Data-Driven Stochastic Optimization
… stochastic optimization and the related Dantzig-Wolfe decomposition. We start with a deterministic setting, where we consider linear programs with a block-structure, but data cannot be stored centrally due to privacy concerns or decentralized storage of large datasets. The larger portion …
-
Multi-level production planning with raw-material perishability and inventory bounds
… a variable-splitting technique that allows for a Dantzig-Wolfe decomposition. The Dantzig-Wolfe principle exploits the structure of the problem by decomposing it into two sub-problems: one relating to the production decisions per item and another that relates to the inventory decisions per period. …
-
Algorithmic techniques for optimal collective communication
… to discrete step-based solutions, and Mirrored Dantzig-Wolfe, which exploits the high degree of symmetry often present in communication networks. We complement our theoretical contributions with experimental results, demonstrating the practical efficacy of the constructed algorithms.
-
A branch-and-price algorith, for a compressor scheduling problem
… a column generation approach based on the Dantzig-Wolfe decomposition, which achieves tighter lower bounds than the straightforward linear relaxation of the piecewise-linear formulation. The column generation was embedded in a branch-and-price algorithm and further compared with CPLEX, …
-
The vehicle routing problem with release and due dates: formulations, heuristics and lower bounds
… formulations, efficient heuristics, and a Dantzig-Wolfe decomposition and associated column generation algorithm. <br/><br/>The MIP formulations extend commodity flow formulations of the capacitated vehicle routing problem, and are generally related by aggregation or disaggregation of the …
-
DATA DRIVEN ALGORITHMS AND DISTRIBUTED COMPUTING FOR AUTOMATIC MIP DECOMPOSITIONS
… research question, that is how to exploit Dantzig-Wolfe decomposition methods for generic Mixed Integer Programs (MIP). In the first part of the thesis, we research how to obtain such decompositions in an automatic fashion. We investigate, with machine learning tools, the link between …
-
Capacitated scheduling in multistage production systems
… but highly structured linear program.</p> <p>A Dantzig-Wolfe decomposition algorithm is developed to solve the model. The capacity constraints of the model are used to define the master problem and the flow balance constraints are used to define one or more subproblems.</p> <p>The constraint …
-
Branch-and-price and multicommodity flows
… in reformulating an original model, using the Dantzig-Wolfe decomposition principle, and then combining column generation with branch-and-bound (branch-and-price) in order to obtain optimal solutions. The main issue when developing a branch-and-price algorithm is the branching scheme. The …
-
Data-Driven Decision Analytics in Complex Systems: Information Infrastructure, Problem Decomposition, and Algorithmic Design
… Specific methodologies include Lagrangian, Dantzig-Wolfe, and Benders decomposition for optimization models, and the hybridization of discrete-event simulation with agent-based modeling for simulation frameworks. Third, complementing decomposition and parallelization, the thesis explores the …
-
Resource-constrained material requirements planning using parallel linear programming
… of a decomposition shell program (based on the Dantzig-Wolfe principle) on a 64-node distributed memory multiprocessor. This shell is capable of solving structured linear programs with up to about 30,000 rows, 120,000 columns and 3.6 million nonzeros. We have also designed and tested a …
-
Revenue-based maintenance scheduling for wind turbines
… were studied. One of these, the so-called Dantzig–Wolfe decomposition, was formulated explicitly for both models and implemented for the in–house model. The result from a run time analysis showed that this method effectively reduces run time for a number of maintenance scheduling cases and …
-
Home therapist network modeling
… is not efficient here because: 1) convergence of Dantzig-Wolfe decomposition is not fast enough; and 2) subproblem is strongly NP-hard and cannot be solved efficiently. The last part of this research studies a simpler case in which all patients have fixed appointment times. The model takes the …
Page 1 of 3