| Being able to solve large mixed-integer linear programming (MILP) problems is important because of numerous applications in production and operations management. This thesis contains a newly developed heuristic solution to the general MILP problem. A comparison of this heuristic solution, a second heuristic solution from the literature, and two commercially available MILP programs is given in detail. Both heuristic solutions have been coded in standard FORTRAN77. All programs are run on a 486 66MHz Intel-based personal computer. Suggestions for future research are also given. |
