Interface Summary Interface Description SimplexCuttingPlaneMinimizer.CutterFactoryThis factory constructs a new
Cutterfor each MILP problem.
Cutterdefines how to cut a simplex table, i.e., how to relax a linear program so that the current non-integer solution is no longer feasible to the relaxation.
Class Summary Class Description GomoryMixedCutMinimizerThis cutting-plane implementation uses Gomory's mixed cut method. GomoryMixedCutMinimizer.MyCutterThis is Gomory's mixed cut. GomoryPureCutMinimizerThis cutting-plane implementation uses Gomory's pure cut method for pure integer programming, in which all variables are integral. GomoryPureCutMinimizer.MyCutterThis is Gomory's pure cut. SimplexCuttingPlaneMinimizerThe use of cutting planes to solve Mixed Integer Linear Programming (MILP) problems was introduced by Ralph E Gomory.