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 178 for “"Linear program"”.
-
An efficient simplex-based method for solving large linear programs
… of solving specific classes of large-scale linear programs is presented. The structure of both staircase and block-angular linear programs is exploited to construct an advanced or "crash" basis to be used with a simplex-based linear program solver. First, the constraint matrix is decomposed …
-
An optimization grouping method in a multi-line manufacturing system
… product grouping method using binary integer linear program for optimization is developed for two production lines in a food packaging manufacturer. A mathematical model is created to assign products to the two dedicated production lines with an objective to minimize the total setup times. The …
-
Optimal monitoring and mitigation of systemic risk in lending networks
… we show that this problem is equivalent to a linear program. We develop a duality-based distributed algorithm to solve it which is useful for applications where it is desirable to avoid centralized data gathering and computation. Since some applications require forecasting and planning for a …
-
Engineering and evaluating bulk data transfer planning over wide area networks
… by evaluating the performance of various GPU linear program solvers on Pandora’s workloads, and by designing and implementing two new systems: a modular C++ framework called Pandora’s Toolbox that solves the bulk data transfer problem, and a web service for planning bulk data transfers. …
-
Revenue optimization for a hotel property with different market segments : demand prediction, price selection and capacity allocation
… We feed these predictions into a mixed integer linear program (MILP) to optimize prices and capacity allocations at the same time. We prove that the MILP can be equivalently solved as a linear program, and then show that it produces upper and lower bounds for the expected revenue maximization …
-
Existence of competitive equilibria in combinatorial auctions
… from tropical geometry, our approach is based on linear programming. Relying on a result from Bikhchandani and Mamer (1999) that a competitive equilibrium exists if and only if a related linear program has an integral optimal solution, we provide a direct proof that the linear program has an …
-
New geometric techniques for linear programming and graph partitioning
… several longstanding questions in the theory of linear programming, polytope theory, spectral graph theory, and graph partitioning. The thesis consists of two main parts. In the first part, which is joint work with Daniel Spielman, we present the first randomized polynomial-time simplex algorithm …
-
Lowering outbound shipping costs in an online retail environment by making better fulfillment and replenishment decisions
… utilizes the dual values of a transportation linear program to estimate the opportunity cost of depleting inventory from a warehouse. This linear program values inventory at a warehouse due to both its geography and the size of its catalogue. After showing that this linear program is …
-
An approach to considering uncertainty in developing long-term, least-cost wood procurement policies
… The approach was termed a partial stochastic linear program because uncertainty was considered by introducing variation into one element of the linear programming model (the right hand side). To implement this approach, subjective evaluations were made, regarding the amount of uncertainty …
-
Optimization tools for process planning
… be formulated as a multiperiod, mixed-integer linear program (MILP). This MILP can then be reformulated by exploiting lot sizing substructures. While the reformulation produces a tight linear programming relaxation, it also introduces a large number of variables and constraints.
-
Consumption minimization of the uranium resources by the use of mixed-oxide fueled reactors
… The model application is developed through a linear program. The analyses of the linear program problem is done by the use of the proprietary mathematical MPS-III system. Specific results indicate that spent uranium and plutonium should be utilized in self-generating reactors in order to …
-
Improvements of Interactive Multiple Objective Optimization Technique and Its Applications
One of the multiple objective linear program techniques, Zionts-Wallenius method is improved in technical and practical point of view. The result of the test are compared through the computing experiments. As an example, the investment decision making methods, especially capital rationing methods …
-
Global Optimization in Systems Biology and Bioinformatics
… thesis, the problem is modeled as an integer linear program with weak assumptions on the binding pattern. A computationally efficient formulation and linearization scheme is developed and the resulting problem is solved to global optimality. The proposed formulation successfully solved the CRP …
-
Convex Relaxations: Beyond Polynomials, Splitting Methods and Average Case Analysis
… of this thesis concerns the use of semidefinite programming for solving optimisation problems involving non-polynomial and non-semialgebraic functions. We start with the problem of determining the logarithmic Sobolev constant of a finite Markov chain, which can be framed as a nonconvex …
-
A generalized label correcting method for optimal kinodynamic motion planning
… a convex set of admissible heuristics. A linear program is formulated to obtain a heuristic which is as close to the optimal cost-to-go as possible while remaining admissible. This optimization is justified by showing its solution coincides with the solution to the Hamilton-Jacobi-Bellman …
-
Computational Methods for Optimal Control of Hybrid Systems
… can be found via convex optimization in a linear program. Moreover, a dual of this optimization problem, parameterized in the control law, has been formulated via general ideas from duality in transportation problems. It is shown that the lower bound of the value function is tight for …
-
An optimal withdrawal policy for spent nuclear fuel from on-site storage
… application is developed through, 1) a dynamic programming approach, 2) a Hitchcock problem to be solved similarly to a minimum-cost-flow problem, and 3) a linear program definable as a Transportation problem. In the model analyses, the dynamic programming formulation proved to be …
-
Minimization of blending losses to determine optimal standard enrichments of nuclear fuel
… as the gas centrifuge. Using a mixed-integer linear program, the model minimizes present worth costs for a 39-product-enrichment reference case. For four ingredients, the marginal blending cost is only 0.18 percent of the total direct production cost. Natural uranium is not an optimal blending …
-
Upper and lower bounds for the fixed spectrum frequency assignment problem
… graph.<br/><br/>A summary of some of the integer programming formulations which model the problem is presented, together with a brief dimensional study of them. <br/><br/>An efficient implementation of two well-known metaheuristic algorithms, adapted to the problem treated, is …
-
Entity-based scene understanding
… regions. Using neural classifiers and integer linear program inference, we show that grounding is improved when forced to conform to relation predictions. We introduce the Flickr30k Entities v2 dataset, and show how our methods can be used to automatically generate similarly rich annotations …
Page 1 of 9