Package dev.nm.solver.multivariate.constrained.integer.linear.cuttingplane
-
Interface Summary Interface Description SimplexCuttingPlaneMinimizer.CutterFactory This factory constructs a newCutter
for each MILP problem.SimplexCuttingPlaneMinimizer.CutterFactory.Cutter ACutter
defines 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 GomoryMixedCutMinimizer This cutting-plane implementation uses Gomory's mixed cut method.GomoryMixedCutMinimizer.MyCutter This is Gomory's mixed cut.GomoryPureCutMinimizer This cutting-plane implementation uses Gomory's pure cut method for pure integer programming, in which all variables are integral.GomoryPureCutMinimizer.MyCutter This is Gomory's pure cut.SimplexCuttingPlaneMinimizer The use of cutting planes to solve Mixed Integer Linear Programming (MILP) problems was introduced by Ralph E Gomory.