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 16 of 16 for “"Bilinear programming"”.
-
Mixed integer bilinear programming with applications to the pooling problem
Solution methodologies for mixed integer bilinear problems (MIBLP) are studied in this dissertation. This problem class is motivated using the pooling problem, a multicommodity network flow problem that typically arises in chemical engineering applications. Stronger than previously known results …
-
The mixed-integer bilinear programming problem with extensions to zero-one quadratic programs
… effort is concerned with a class of mathematical programming problems referred to as Mixed-Integer Bilinear Programming Problems. This class of problems, which arises in production, location-allocation, and distribution-application contexts, may be considered as a discrete version of the …
-
A new reformulation-linearization technique for the bilinear programming and related problems, with applications to risk management
… development of a new algorithm for the general Bilinear Programming Problem (BlP). BLP's are a class of nonlinear, non convex problems that belong to a higher class known as Biconvex Programming Problems (BCP). These problems find numerous applications in engineering, industrial, and management …
-
Markov random fields with unknown heterogeneous graphs
… can be achieved simultaneously by solving a bilinear programming problem, for which we provide a branch and bound solver. Second, we relax the inference problem into a tighter non-convex quadratic programming problem, and propose a convex-concave procedure algorithm to solve the non-convex …
-
Formulations and solution methods for global optimization of the Pooling problem and its extensions
… optimization. Due to huge economic savings, this bilinear programming problem (BLP) has attracted many researchers in global optimization and boosted the development in this field. The thesis is concerned with formulations and algorithms for the pooling problem and its extensions. A key issue in …
-
A reformulation-linearization based implicit enumeration algorithm for the rectilinear distance location-allocation problem
… The problem is formulated as a Mixed Integer Bilinear Programming Problem and as a Discrete Location Allocation Problem. Using linear programming relaxations constructed via the Reformulation-Linearization Technique (RLT), the latter formulation is shown to provide stronger lower bounds and is …
-
Topics in Mixed Integer Nonlinear Optimization
… optimization - including mixed integer linear programming and nonlinear programming, where both theoretical analyses and computational experiments are presented. In the first chapter we look at Mixed Integer Quadratic Programming (MIQP), the problem of minimizing a convex quadratic function …
-
SHUTTLE-LINE ROUTING FOR MOBILITY-ON-DEMAND SYSTEMS WITH RIDESHARING
… In this thesis, we present our Mixed-Integer Bilinear Programming (MIBLP) models for solving SRP variants and linearization of these models using the linearization technique. In addition, we propose a nested optimization approach using Bayesian Optimization for solving our MIBLP models, which …
-
Enhanced intersection cutting plane and reformulation-linearization enumeration based approaches for linear complementarity problems
… economics, engineering, mechanics, and quadratic programming. This class of problems has posed a challenge to researchers for over three decades now. Most of the current algorithms designed to solve LCP are guaranteed to work only under some restrictive assumptions on the matrix <i>M</i> …
-
Um novo método para sintonia de controladores PID não lineares sob restrições usando modelo Fuzzy Takagi-Sugeno
… conditions are used in the formulation of a bilinear programming problem whose solution provides the controller parameters that satisfy the constraints and an associated invariant set. Throughout the development of the work, several variations of the main technique were explored and their …
-
Chance Constrained Programs and Distributionally Favorable Optimization
… an optimal solution to a CCP; (ii) an equivalent bilinear programming formulation of a CCP, inspiring us to enhance ALSO-X with a convergent alternating minimization method (ALSO-X+); (iii) an extension of ALSO-X and ALSO-X+ to solve distributionally robust chance constrained programs (DRCCPs) …
-
Decomposition Methods in Column Generation and Data-Driven Stochastic Optimization
… failure probabilities. By using ideas from bilinear programming and penalty methods, we provide tractable approximations of our two-stage DRO model which can be iteratively improved using lift-and-project techniques. We illustrate the computational and out-of-sample performance of our method …
-
Polynomial and indefinite quadratic programming problems: algorithms and applications
… with the global optimization of polynomial programming problems, and a detailed treatment of its particular special case, the indefinite quadratic programming problem. Polynomial programming problems are generally nonconvex, involving the optimization of a polynomial objective function over …
-
Automated Reasoning For Uncertain Markov Processes
… such guarantees is equivalent to solving a bilinear program, which are classically NP-hard problems. We develop a special decomposition algorithm that solves the bilinear program orders-of-magnitude faster than state-of-the-art solvers. Our algorithmic developments are implemented in two …
-
Observer-based output feedback control using invariant polyhedral sets for fuzzy T-S models under constraints
… de invariância, um problema de otimização bilinear é formulado para calcular simultaneamente os ganhos do controlador e do observador e o poliedro positivamente invariante que garantem a satisfação das restrições. São considerados os dois tipos de observador encontrados na literatura de …
-
Strong convex relaxations for quadratically constrained quadratic programs
… these functions together with integer linear programming-based functions are sufficient to yield the integer hull of intersections of conic sections in $\mathbb{R}^2$. In the next three chapters of the thesis, we study convexification of sets related to the quadratically constrained quadratic …