Description: By cutting plane method for solving integer programming. Not considered integer constraints, the optimal solution relaxation problem, if the integer obtained optimal solution is sought, and operation stops. If the optimal solution does not satisfy the integer constraints, then on the basis of this non-integer solutions adding new constraints on the re-solving.
To Search:
File list (Check if you may need any files):
DividePlane.m
Download