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 34 for “"reformulation linearization technique"”.
-
Global Optimization of the Nonconvex Containership Design Problem Using the Reformulation-Linearization Technique
… modeling, approximation, and global optimization techniques for developing a multidisciplinary approach to the containership design problem. The problem involves five design variables, which prioritized according to their relative importance in the model are: design draft, depth at side, speed, …
-
A new reformulation-linearization technique for the bilinear programming and related problems, with applications to risk management
… environments. The new algorithm develops a novel Reformulation-Linearization Technique (RlT) that uses an enumeration of variable factors to multiply constraints, and uses constraints to multiply constraints, to generate new nonlinear constraints which are subsequently linearized by defining new …
-
A reformulation-linearization based implicit enumeration algorithm for the rectilinear distance location-allocation problem
… programming relaxations constructed via the Reformulation-Linearization Technique (RLT), the latter formulation is shown to provide stronger lower bounds and is therefore adopted for implementation. In addition, cutting planes are developed to further strengthen the linear programming …
-
GPU accelerated Hungarian algorithm for traveling salesman problem
… function and constraints. This is referred to as Reformulation Linearization Technique at Level 2 (or RLT2). We apply dual ascent procedure for obtaining lower bounds that employs Linear Assignment Problem (LAP) solver recently developed by Date(2016). The solver is a parallelized Hungarian …
-
Tight Polyhedral Representations of Discrete Sets Using Projections, Simplices, and Base-2 Expansions
… of relatively unknown polytopes that enable the linearization of polynomial expressions involving two discrete variables. Projections of higher-dimensional convex hulls are employed to reduce the dimensionality of the requisite linearizing polyhedra. For certain lower dimensions, a complete …
-
Application of Optimization Techniques to Water Supply System Planning
… A branch-and-bound algorithm based on the reformulation-linearization technique is then developed for solving the model to global optimality. To handle uncertainty in the planning process, a stochastic programming (SP) model and a robust optimization (RO) model are successively proposed to …
-
Heuristic and Exact Techniques for Solving a Temperature Estimation Model
This dissertation provides several techniques for solving a class of nonconvex optimization problems that arise in the thermal analysis of electronic chip packages. The topic is of interest because in systems containing delicate electronic components both performance and reliability are impacted by …
-
Solving Factorable Programs with Applications to Cluster Analysis, Risk Management, and Control Systems Design
… This dissertation focuses on employing the Reformulation-Linearization Technique (RLT) to enhance model formulations and to design effective solution techniques for solving several practical instances of continuous nonconvex optimization problems, namely, the hard and fuzzy clustering …
-
Development of Optimization and Simulation Models for the Analysis of Airfield Operations
… we develop a mathematical model and apply the Reformulation-Linearization-Technique (RLT) of Sherali and Adams to construct an enhanced tightened version of the proposed model. Since ASP is NP-Hard and in fact, it is a variation of the well-known Traveling Salesman Problem with time-windows, …
-
A new hierarchy of relaxations for 0-1 mixed integer problems with application to some specially structured problems
… of relaxations is developed that extends the Reformulation-Linearization Technique (RLT) of Sherali and Adams (1989, 1990). This hierarchy referred to as (RLT1), provides a unifying framework for constructing a spectrum of continuous relaxations spanning from the linear programming relaxation …
-
Semidefinite Cuts and Partial Convexification Techniques with Applications to Continuous Nonconvex Optimization, Stochastic Integer Programming, and Facility Layout Problems
This dissertation develops efficient solution techniques for general and problem-specific applications within nonconvex optimization, exploiting the constructs of the Reformulation-Linearization Technique (RLT). We begin by developing a technique to enhance general problems in nonconvex …
-
Algorithmic Approaches for Solving the Euclidean Distance Location and Location-Allocation Problems
… (EMFLP), two equivalent convex differentiable reformulations are proposed. The first of these is formulated directly in the primal space, and relationships between its Karush-Kuhn-Tucker (KKT) conditions and the necessary and sufficient optimality conditions for EMFLP are established in order …
-
Enhanced intersection cutting plane and reformulation-linearization enumeration based approaches for linear complementarity problems
… a global optimization algorithm based on a novel Reformulation-Linearization Technique (RLT). We do not place any restrictions on the matrix M associated with LCP in this case. This RLT scheme provides an equivalent linear, mixed integer programming formulation of LCP, that possesses a tight …
-
Network Design and Analysis Problems in Telecommunication, Location-Allocation, and Intelligent Transportation Systems
… problem, we develop a model and apply the Reformulation-Linearization Technique (RLT) to construct various enhanced tightened versions of the proposed model. We also design efficient Lagrangian dual schemes for solving the linear programming relaxation of the various enhanced models, and …
-
A Discrete Optimization Approach to Solve a Reader Location Problem for Estimating Travel Times
… An optimization approach based on the Reformulation-Linearization Technique coupled with Semidefinite Programming concepts is designed to solve the formulated reader location problem. This approach can be used to derive alternative equivalent formulations of the problem that vary in the …
-
Optimization Models and Analysis of Routing, Location, Distribution, and Design Problems on Networks
… polyhedral outer approximations and applying the Reformulation-Linearization Technique (RLT), a tight linear lower bounding problem is derived. This problem provides an enhancement and a more precise representation of previous lower bounding relaxations that use similar approximations. …
-
Polyhedral Approximations of Quadratic Semi-Assignment Problems, Disjunctive Programs, and Base-2 Expansions of Integer Variables
… quadratic program. The effort begins by using a reformulation-linearization technique to recast the problem as a mixed 0-1 linear program. The resulting form provides insight into identifying special instances that are readily solvable. For the general case, the form is shown to have a tight …
-
Global Optimization of Nonconvex Factorable Programs with Applications to Engineering Design Problems
… polynomials, coordinated with a {em Reformulation-Linearization Technique} (RLT). The initial stage of the lower bounding step generates a tight, nonconvex polynomial programming relaxation for the given problem. Subsequently, an LP relaxation is constructed for the resulting …
-
Tight Discrete Formulations to Enhance Solvability with Applications to Production, Telecommunications, and Air Transportation Problems
… management problem. We first consider the Reformulation-Linearization Technique (RLT) of Sherali and Adams and explore the generation of reduced first-level representations for mixed-integer 0-1 programs that tend to retain the strength of the full first-level linear programming relaxation. …
-
Linear Programming Methods for Identifying Solvable Cases of the Quadratic Assignment Problem
… methods based on an equivalent mixed 0-1 linear reformulation of the problem. The continuous relaxation of this mixed 0-1 form yields a feasible region having extreme points that are both binary and fractional. The solvable instances of concern essentially possess objective function structures …
Page 1 of 2