Solving an LP with CPLEX Technology

To help you learn which CPLEX technology best meets your needs, we briefly demonstrate here how to create and solve an LP model, using four different interfaces to CPLEX. Full details of writing a practical program are in the chapters containing the tutorials.

The problem to be solved is:

Maximize
x1 + 2x2 + 3x3
subject to
-x1 + x2 + x3 20
x1 - 3x2 + x3 30
with these bounds
0 x1 40
0 x2 +
0 x3 +


Previous Page: Data Entry Options   Return to Top Next Page: Using the Interactive Optimizer