Class BurdetJohnsonCut

java.lang.Object
All Implemented Interfaces:
LinearConstraint

public class BurdetJohnsonCut
extends ChvatalGomoryCut
BurdetJohnsonCut implements the Burdet-Johnson Cut for ILP. The References are:

  • Burdet, C. A., and E. L. Johnson (1977): A Sub-additive Approach to Solve Linear Integer Programs Annals of Discrete Mathematics 1 117-143
  • Chvatal, V. (1973): Edmonds Polytopes in a Hierarchy of Combinatorial Problems Discrete Mathematics 4 (4) 305-337
  • Gomory, R. E. (1958): Outline of an Algorithm for Integer Solutions to Linear Programs Bulletin of the American Mathematical Society 64 (5) 275-278
  • Kelley, J. E. (1960): The Cutting Plane Method for Solving Convex Problems Journal for the Society of the Industrial and Applied Mathematics 8 (4) 703-712
  • Letchford, A. N. and A. Lodi (2002): Strengthening Chvatal-Gomory Cuts and Gomory Fractional Cuts Operations Research Letters 30 (2) 74-82


Author:
Lakshmi Krishnamurthy
  • Constructor Details

    • BurdetJohnsonCut

      public BurdetJohnsonCut​(int[][] aGrid, int[] bArray, double[] lambdaArray) throws java.lang.Exception
      BurdetJohnsonCut Constructor
      Parameters:
      aGrid - "A" Constraint Grid
      bArray - "b" Constraint Array
      lambdaArray - The Lambda Array
      Throws:
      java.lang.Exception - Thrown if the Inputs are Invalid
  • Method Details