Rule Solver – Simple Arithmetic Problem

Problem Description. There are 3 variables X, Y, and Z with possible values from 1 to 10. It is known that

X < Y and X + Y = Z.

Find a solution (values of X, Y, and Z) that maximizes Z.

Implementation. You can find the implementation in the project “openrules.solver/Arithmetic”. Here is the Glossary:

We will rely on the standard Rule Solver top-level decision “DefineAndSolve”:

Here are our two main sub-decisions “Define” and “Solve”:

The following tables define the objective and post constraints:

When we execute this decision model with “test.bat”, it will produce the following results: