A cutting plane method for solving linear generalized disjunctive programming problems
Authors:
- 1 August 2005
- journal article
- Published by Elsevier in Computers & Chemical Engineering
- Vol. 29 (9) , 1891-1913
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Modeling of discrete/continuous optimization problems: characterization and formulation of disjunctions and their relaxationsComputers & Chemical Engineering, 2003
- High-Level Optimization Model for the Retrofit Planning of Process NetworksIndustrial & Engineering Chemistry Research, 2002
- New algorithms for nonlinear generalized disjunctive programmingComputers & Chemical Engineering, 2000
- Convex programming for disjunctive convex optimizationMathematical Programming, 1999
- A branch-and-cut method for 0-1 mixed convex programmingMathematical Programming, 1999
- Exact algorithms for the guillotine strip cutting/packing problemComputers & Operations Research, 1998
- On the dimension of projected polyhedraDiscrete Applied Mathematics, 1998
- Logic-based MINLP algorithms for the optimal synthesis of process networksComputers & Chemical Engineering, 1996
- Modelling and computational techniques for logic based integer programmingComputers & Chemical Engineering, 1994
- A lift-and-project cutting plane algorithm for mixed 0–1 programsMathematical Programming, 1993