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 7 of 7 for “"Pooling problem"”.
-
A Lagrangean Relaxation and A Heuristic for the Pooling Problem
The pooling problem is one of the fundamental optimization problems encountered in the petroleum industry. In the pooling problem, final products are produced using two stages of blending operations. In the first stage, raw materials are mixed together to produce intermediate products. In the …
-
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 …
-
Formulations and solution methods for global optimization of the Pooling problem and its extensions
The pooling problem is an important research topic in global 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 …
-
A global optimization approach to pooling problems in refineries
The pooling problem is an important optimization problem that is encountered in operation and scheduling of important industrial processes within petroleum refineries. The key objective of pooling is to mix various intermediate products to achieve desired properties and quantities of products. …
-
Design and implementation of flexible manufacturing systems: some analysis concepts
… analysis concepts and decision tools for the problems encountered in designing and implementing a flexible manufacturing system. SIM-Q, an input-generator for simulation modelling developed in this study provides a powerful and expedient tool for resolving the material handling system …
-
Strong convex relaxations for quadratically constrained quadratic programs
… program (QCQP). This is an optimization problem in which the objective function is a quadratic function and the feasible region is defined by quadratic constraints. Solving non-convex quadratically constrained quadratic program to global optimality is a well-known NP-hard problem, and a …
-
Shared Mobility On Demand System Design
… study the shared centralized class of mobility problems which considers a platform of self driving cars. There are new challenges with these systems such as how to balance the idle vehicle, how to price the shared autonomous system, and etc. We are attempting to address the question of how to …