This subproject is part of a repo illustrating constraint programming. This subproject illustrates solving an optimization/linear programming problem using Apache Commons Math, Choco (with and without ibex integration), Jacop (using scalar-product/weighted-sum and knapsack algorithms), Ojalgo, OrTools, and SAS/OR. The slides also show solving this example using Excel and Google sheets.
See also: Optaplanner solution. Timefold solution.
You have the following options to run the examples:
- running locally on the command-line or in an IDE
- running via gitpod
- running as a Jupyter/BeakerX notebook
(more details)
- running in the Groovy Console or Groovy Web Console
Command-line arguments for Gradle:
gradlew :DietOptaPlanner:run