Uses of Package
dev.nm.solver.multivariate.constrained.integer.linear.cuttingplane

Packages that use dev.nm.solver.multivariate.constrained.integer.linear.cuttingplane

Package	Description
dev.nm.solver.multivariate.constrained.integer.linear.cuttingplane

Classes in dev.nm.solver.multivariate.constrained.integer.linear.cuttingplane used by dev.nm.solver.multivariate.constrained.integer.linear.cuttingplane

Class and Description
SimplexCuttingPlaneMinimizer The use of cutting planes to solve Mixed Integer Linear Programming (MILP) problems was introduced by Ralph E Gomory.
SimplexCuttingPlaneMinimizer.CutterFactory This factory constructs a new Cutter for each MILP problem.
SimplexCuttingPlaneMinimizer.CutterFactory.Cutter A Cutter 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.