ILOG CPLEX 10.2 Getting Started > Tutorials > Concert Technology Tutorial for C++ Users > Building and Solving a Small LP Model in C++ |
Building and Solving a Small LP Model in C++ |
INDEX
![]() |
A complete example of building and solving a small LP model can now be presented. This example demonstrates:
Example ilolpex1.cpp
, which is one of the example programs in the standard ILOG CPLEX distribution, is an extension of the example presented in Introducing ILOG CPLEX. It shows three different ways of creating an ILOG Concert Technology LP model, how to solve it using IloCplex
, and how to access the solution. Here is the problem that the example optimizes:
Maximize |
x1 + 2x2 + 3x3 |
subject to |
-x1 + x2 + x3 ![]()
x1 - 3x2 + x3 ![]() |
with these bounds |
0 ![]() ![]()
0 ![]() ![]() ![]()
0 ![]() ![]() ![]() |
Copyright © 1987-2007 ILOG S.A. All rights reserved. Legal terms. | PREVIOUS NEXT |