ILOG CPLEX 11.0 Getting Started > Tutorials > Concert Technology Tutorial for .NET Users > Describe > Building a Small LP Problem in C# |
Building a Small LP Problem in C# |
INDEX PREVIOUS NEXT |
Here is a conventional formulation of the problem that the example optimizes:
Maximize |
x1 + 2x2 + 3x3 |
subject to |
-x1 + x2 + x3 20
x1 - 3x2 + x3 30 |
with these bounds |
0 x1 40
0 x2 +
0 x3 + |
x1, x2, x3 |
-x1 + x2 + x3 20
x1 - 3x2 + x3 30 | |
0 x1 40
0 x2 +
0 x3 + |
Maximize |
x1 + 2x2 + 3x3 |
Copyright © 1987-2007 ILOG S.A. All rights reserved. Legal terms. | PREVIOUS NEXT |