Arguments: int item_id, bool is_item_in,
int64_t* lower_bound,
int64_t* upper_bound
Gets the lower and upper bound when the item is in or out of the knapsack.
To ensure objects are correctly initialized, this method should not be
called before ::Init.
[[["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."],[[["`BaseKnapsackSolver` serves as the foundational class for all knapsack solvers within the OR-Tools library."],["It provides essential functionalities such as initialization with problem data (profits, weights, capacities), solving the knapsack problem, and retrieving the optimal solution."],["Methods like `GetLowerAndUpperBoundWhenItem` and `best_solution` offer insights into the solution space and individual item placements."],["Users should call `Init` to set up the problem before invoking `Solve` to find the optimal solution within the given time limit."]]],[]]
