FINITE DISJUNCTIVE PROGRAMMING METHODS FOR GENERAL MIXED INTEGER LINEAR PROGRAMS
In this dissertation, a finitely convergent disjunctive programming procedure, the Convex Hull Tree (CHT) algorithm, is proposed to obtain the convex hull of a general mixed–integer linear program with bounded integer variables. The CHT algorithm constructs a linear program that has the same optimal...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en |
| Published: |
The University of Arizona.
2011
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10150/145120 |