The One and Only Gomory Cuts Machine

Disclaimer

  1. This module features a Simplex Machine for solving integer programming problems using the Gomory's Cutting plan method.

  2. The module was design for persons who know (more or less) what they are doing.

  3. There are two steps to the process.
    1. solve the "relaxed" LP problem
    2. 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.

  4. Because in each iteration of the second stage a new constraint (and variable) is added, the size of the tableau can become large.

  5. In short, this module provides a useful facility for users who wish to experiments with the Gomory's Cutting plan method for IP problems.


Contributed by

© The University of Melbourne 1994-2000.
Disclaimer and Copyright Information.
Conditions of use.
Date created: January 15, 2000
Date last modified: February 15, 2000
Authorised by: Moshe Sniedovich
Maintained by: Moshe Sniedovich, Department of Mathematics and Statistics.
Email: m.sniedovich@ms.unimelb.edu.au