© The University of Melbourne 1994-2000.
This module features a Simplex Machine for solving integer programming problems using the Gomory's Cutting plan method.
The module was design for persons who know (more or less) what they are doing.
There are two steps to the process.
- solve the "relaxed" LP problem
- Add Gomory Cuts (constraint) to the problem
The second step is repeated until an optimal integer solution is found or until it is discovered that the problem does not have an integer solution.Because in each iteration of the second stage a new constraint (and variable) is added, the size of the tableau can become large.
In short, this module provides a useful facility for users who wish to experiments with the Gomory's Cutting plan method for IP problems.