In the OptimizeSingleRoute() and Optimize() methods, if both "cumul_values"
and "cost" parameters are null, we don't optimize the cost and stop at the
first feasible solution in the linear solver (since in this case only
feasibility is of interest).
[[["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."],[[["`DimensionCumulOptimizerCore` is a utility class used for setting constraints and solving optimization problems related to routing dimensions within the OR-Tools library."],["It provides methods for optimizing the cumulative values and breaks of a dimension, for single routes or the entire problem."],["Optimization can be performed with or without considering resource constraints and costs, allowing for flexibility in problem solving."],["The class offers functions like `Optimize`, `OptimizeAndPack`, and variations for single routes and resources, to address different optimization scenarios."],["Methods like `OptimizeSingleRoute` and `Optimize` allow for focusing on feasibility if cost parameters are not provided."]]],["The `DimensionCumulOptimizerCore` class, used within `Local/GlobalDimensionCumulOptimizer`, manages linear solver constraints. Key methods include `Optimize`, `OptimizeAndPack`, and their single-route variants. These functions set and solve constraints for a given dimension, using a solver and accessing route and resource information. They handle cumul and break value vectors, cost calculations, and resource indexing. The methods can also stop at the first feasible solution if cost is not being optimized. The class also has a `dimension` method.\n"]]
