NDLTD logo NDLTD Union Catalog and Global ETD Search

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 24 for “"Reformulation-Linearization Technique (RLT)"”.

  1. A reformulation-linearization based implicit enumeration algorithm for the rectilinear distance location-allocation problem

    Ramachandran, SridharVirginia Tech1991

    … 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 …

    vt Repository record

  2. A new reformulation-linearization technique for the bilinear programming and related problems, with applications to risk management

    Alameddine, Amine R.Virginia Tech1990

    … 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 …

    vt Repository record

  3. Solving Factorable Programs with Applications to Cluster Analysis, Risk Management, and Control Systems Design

    Desai, JitamitraVirginia Tech2005

    … 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 …

    vt Repository record

  4. Development of Optimization and Simulation Models for the Analysis of Airfield Operations

    Baik, HojongVirginia Tech2000

    … 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, …

    vt Repository record

  5. A new hierarchy of relaxations for 0-1 mixed integer problems with application to some specially structured problems

    Driscoll, Patrick J.Virginia Polytechnic Institute and State University1995

    … 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 …

    vt Repository record

  6. Semidefinite Cuts and Partial Convexification Techniques with Applications to Continuous Nonconvex Optimization, Stochastic Integer Programming, and Facility Layout Problems

    Fraticelli, Barbara M. P.Virginia Tech2001

    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 …

    vt Repository record

  7. Enhanced intersection cutting plane and reformulation-linearization enumeration based approaches for linear complementarity problems

    Krishnamurthy, Ravi S.Virginia Tech1995

    … 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 …

    vt Repository record

  8. Network Design and Analysis Problems in Telecommunication, Location-Allocation, and Intelligent Transportation Systems

    Park, TaehyungVirginia Tech1998

    … 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 …

    vt Repository record

  9. Global Optimization of Nonconvex Factorable Programs with Applications to Engineering Design Problems

    Wang, HongjieVirginia Tech1998

    … 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 …

    vt Repository record

  10. Polynomial and indefinite quadratic programming problems: algorithms and applications

    Tuncbilek, Cihan H.Virginia Tech1994

    … present a branch and bound algorithm that uses a Reformulation Linearization Technique (RLT) to generate tight linear programming relaxations. This bounding scheme involves an automatic reformulation of the problem via the addition of certain nonlinear implied constraints that are generated by …

    vt Repository record

  11. Optimization Models and Analysis of Routing, Location, Distribution, and Design Problems on Networks

    Subramanian, ShivaramVirginia Tech1999

    … 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. …

    vt Repository record

  12. Algorithmic Approaches for Solving the Euclidean Distance Location and Location-Allocation Problems

    Al-Loughani, Intesar MansourVirginia Tech1997

    … (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 …

    vt Repository record

  13. Integrated Aircraft Fleeting, Routing, and Crew Pairing Models and Algorithms for the Airline Industry

    Shao, ShengzhiVirginia Tech2013

    … which is then linearized and lifted using the Reformulation-Linearization Technique (RLT). The resulting formulation remains polynomial in size, and we show that it can be solved very efficiently by commercial software without complicated algorithmic implementations. Our numerical experiments …

    vt Repository record

  14. Tactical Network Flow and Discrete Optimization Models and Algorithms for the Empty Railcar Transportation Problem

    Suharko, Arief BimantoroVirginia Tech1997

    … some partial convex hull constructions using the Reformulation-Linearization Technique (RLT). This tightening of the underlying linear programming relaxation is shown to permit the solution of larger problem sizes, and enables the exact solution of certain scenarios having 5,000 - 8,000 arcs. …

    vt Repository record

  15. Video Communications over Dynamic Ad Hoc Networks

    Kompella, Sastry Venkata SubrahmanyaVirginia Tech2006

    … by leveraging recent advances in video coding techniques along with novel cross-layer formulations and powerful optimization techniques. We follow an application centric cross-layer approach to address multimedia service provisioning over ad hoc networks. Our research efforts show that video …

    vt Repository record

  16. GPU accelerated Hungarian algorithm for traveling salesman problem

    Kaushik, Varsha Ravi PrakashUniversity of Illinois at Urbana-Champaign2017

    … 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 …

    uiuc Repository record

  17. MIMO Wireless Networks: Modeling and Optimization

    Liu, JiaVirginia Tech2010

    … some novel algorithmic design and optimization techniques that provide optimal or near-optimal solutions. Based on network structure, this dissertation is organized into two parts. In the first part, we focus on single-hop MIMO wireless networks, while in the second part, we focus on multi-hop …

    vt Repository record

  18. Global Optimization of the Nonconvex Containership Design Problem Using the Reformulation-Linearization Technique

    Ganesan, VikramVirginia Tech2001

    … 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, …

    vt Repository record

  19. Discrete and Continuous Nonconvex Optimization: Decision Trees, Valid Inequalities, and Reduced Basis Techniques

    Dalkiran, EvrimVirginia Tech2011

    … approach, as well as development of enhanced Reformulation-Linearization Technique (RLT)-based linear programming (LP) relaxations for solving nonconvex polynomial programming problems, through the generation of valid inequalities and reduced representations, along with the design and …

    vt Repository record

  20. Modeling and Optimization of Rechargeable Sensor Networks

    Xie, LiguangVirginia Tech2013

    … solution by a piecewise linear approximation technique and prove its performance guarantee. This first study shows that network lifetime bottleneck can be fundamentally resolved by WET. 2. Multi-node Charging for a Dense WSN. We next exploit recent advances in MRC that allows multiple sensor …

    vt Repository record

Page 1 of 2