[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2024-08-06 UTC."],[[["\u003cp\u003eThe \u003ccode\u003eIntegerRoundingCutHelper\u003c/code\u003e class in C++ assists in generating Gomory Mixed Integer cuts for mixed-integer programming problems.\u003c/p\u003e\n"],["\u003cp\u003eThe primary method, \u003ccode\u003eComputeCut\u003c/code\u003e, takes linear programming values, variable bounds, and an implied bounds processor to generate a cutting plane constraint.\u003c/p\u003e\n"],["\u003cp\u003eThe \u003ccode\u003eNumLiftedBooleans\u003c/code\u003e method provides insight into the cut generation process by reporting the number of Boolean variables used for lifting during the last \u003ccode\u003eComputeCut\u003c/code\u003e call.\u003c/p\u003e\n"]]],["The `IntegerRoundingCutHelper` class in C++ provides functionality for generating cutting planes in optimization. The core method is `ComputeCut`, which takes rounding options, linear programming values, lower and upper bounds, an implied bounds processor, and a linear constraint as input to generate a cut. `NumLiftedBooleans` returns the number of lifted Booleans created during the last `ComputeCut` call for analysis.\n"],null,[]]
