Problem statement
This linear programming model in a standard formulation can be solved in each of the components of CPLEX.
The problem to be solved is:
| Maximize | x 1 + 2x 2 + 3x 3 |
| subject to | –x 1 + x 2 + x 3 x 1 – 3x 2 + x 3 |
| with these bounds | 0 0 0 |