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 217 for “"Linear programs"”.
-
Shadow prices in linear programs
<p>It is well known that in linear programming, the optimal values of the dual variables can be interpreted as shadow prices (marginal values) of the right-hand-side coefficients. However, this is true only under nondegeneracy assumptions. Since real problems are often degenerate, the output from …
-
Symmetry Detection in Integer Linear Programs
… generated when solving highly symmetric integer programs (IPs) can contain many identical subproblems, resulting in a waste of computational effort. Effective methods have been developed to exploit known symmetry. This thesis focuses on improving methods that compute the symmetry group of an IP. …
-
Decomposition methods for large-scale linear programs
… present several methods for solving large-scale linear programs which exhibit a special structure in the constraint matrix. By utilizing the special form, the restrictiveness of a large basis which would be required if the simplex procedure was applied directly is avoided.</p><p>Two different …
-
On termination and divergence of linear programs
… some of the central problems in the study of linear programs, and to provide an up-to-date survey of the latest results in this field.</p> <p>In particular, we review some of the classical decision problems in the theory of linear recurrence sequences. Namely, we revisit the Skolem Problem, …
-
Parallel algorithm for solving integer linear programs
Linear programs, or LPs, are often used in optimization problems, such as improving manufacturing efficiency of maximizing the yield from limited resources. The most common method for solving LPs is the Simplex Method, which will yield a solution, if one exists, but over the real numbers. From a …
-
Branch-and-cut for complementarity-constrained linear programs
A Complementarity-Constrained Linear Program (CCLP) is a linear program which has additional constraints called complementarity constraints. Which are such that, for some sets of variables, at most one variable can be positive. Numerous real world problems, such as resource allocation problems, can …
-
Decomposition techniques for large scale stochastic linear programs
<p>Stochastic linear programming is an effective and often used technique for incorporating uncertainties about future events into decision making processes. Stochastic linear programs tend to be significantly larger than other types of linear programs and generally require sophisticated …
-
Methods for solving large-scale bounded linear programs
… to present two methods for solving large-scale linear programs which impose certain restrictions on the values of the variables. By taking advantage of the restrictions on the variables, the restrictiveness of working with a large basis, which would be required if the simplex procedure was …
-
A complementarity approach to multistage stochastic linear programs
… mit der Approximation von 'Multistage Stochastic Linear Programs' (MSLP), wo einige Modelldaten als zufällig vorausgesetzt werden und sich sukzessiv in diskreter Zeit $t=1,...,T$ realisieren, wobei $T$ ein endlicher Planungshorizont sei. Entscheidungen zum Zeitpunkt $t$ sollen so gefällt werden, …
-
The Robustness Gap for Uncertain Multiobjective Linear Programs
… of this gap for uncertain multiobjective linear programs is presented. Numerical examples are developed and results are reported for the first time.
-
Bin packing, number balancing, and rescaling linear programs
… a polynomial-time rounding scheme for a standard linear programming relaxation of the problem, yielding a packing that uses at most $OPT+O(\log{OPT})$ bins. This makes progress towards one of the ``10 open problems in approximation algorithms'' stated in the book of Shmoys and Williamson. In fact, …
-
Lower Bounds for Interactive Compression and Linear Programs
… settings - interactive compression and linear programs. The first part of this thesis studies data compression in interactive models. In the classical setting of data compression, we have a sender that wishes to convey a message to a receiver by transmitting as few bits as possible. …
-
Distributed optimization of linear programs using Dantzig-Wolfe decomposition
… thesis studies the optimization of block-angular linear programs using distributed 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 …
-
A technique for speeding convergence in solving linear programs
… the number of iterations necessary for solving linear programs using the primal-dual algorithm is presented. It appears that the new method will also decrease the number of iterations over any other simplex algorithm. A FORTRAN program incorporating the technique, as well as some comparative …
-
Benders Decomposition Algorithms To Solve Bi-objective Linear Programs
… is employed to explicitly solve Bi-objective Linear Programmes (BLPs). In this thesis, we incorporate the use of BD to bi-objective optimisation problems. We propose a bi-objective Benders reformulation of a non-decomposed BLP and demonstrate how a Benders reformulation can be derived for …
-
Empirical Analysis of Algorithms for Block-Angular Linear Programs
… of decomposition algorithms. We focus on linear programs with a block-angular structure. Decomposition algorithms used to be the only way to solve large-scale special structured problems, in terms of memory limit and CPU time. However, with the advances in computer technology over the past …
Page 1 of 11