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 are provided to compare the strengths of polyhedral relaxations of the pooling problem. A novel single node flow relaxation, defined by a bilinear equality constraint and flow balance, is proposed for the pooling problem. Linear valid inequalities in the original space of variables are derived using a well-known technique called lifting. Mixed integer linear (MILP) formulations are proposed for generating feasible solutions to the pooling problem. Some of these MILP models arise from variable discretizations while others possess a network flow interpretation. The effectiveness of these MILP models is empirically validated on a library of medium and large-scale instances. General MIBLPs, not necessarily pooling problems, are solved using extended MILP reformulations. The reformulation is obtained by writing binary representation for each general integer variable. Facet-defining inequalities are provided for the reformulation of each bilinear term. New valid inequalities are also proposed for bilinear terms with a nontrivial upper bound. The proposed reformulation and cutting planes are compared against a global solver on five different classes of MIBLPs.
| Identifer | oai:union.ndltd.org:GATECH/oai:smartech.gatech.edu:1853/45761 |
| Date | 10 August 2012 |
| Creators | Gupte, Akshay |
| Publisher | Georgia Institute of Technology |
| Source Sets | Georgia Tech Electronic Thesis and Dissertation Archive |
| Detected Language | English |
| Type | Dissertation |
Page generated in 0.0022 seconds