From db50a037043a80bb0f86b9ca5c7ade6721b1a96f Mon Sep 17 00:00:00 2001 From: "steinkirch.eth, phd" <1130416+mvonsteinkirch@users.noreply.github.com> Date: Sat, 1 Apr 2023 16:45:42 -0700 Subject: [PATCH] Create or_tools.md --- technologies/or_tools.md | 11 +++++++++++ 1 file changed, 11 insertions(+) create mode 100644 technologies/or_tools.md diff --git a/technologies/or_tools.md b/technologies/or_tools.md new file mode 100644 index 0000000..aa05b4b --- /dev/null +++ b/technologies/or_tools.md @@ -0,0 +1,11 @@ +## google's or-tools + +
+ +### tl; dr + +* the goal of optimization is to find the best solution to a problem out of a large set of possible solutions (or any feasible solution). +* all optimization problems have the following elements: + * the **objective**: the quantity you want to optimize. an optimal solution is one for which the value of the objective function is the best, i.e. max or min. + * the **constraints**: restrictions on the set of possible solutions, based on the specific requirements of the problem. a feasible solution is one that satisfies all the given constraints for the problem, without necessarily being optimal. +* [google's or-tools](https://developers.google.com/optimization/introduction) is an open-source software for combinatorial optimization, which seeks to find the best solution to a problem out of a very large set of possible solutions.