> Meet ILOG CPLEX > In This Manual > Examples Online

Examples Online

 INDEX Gray bullet PREVIOUS NEXT

For the examples explained in the manual, you will also see the complete code for the solution, so that you can see exactly how ILOG CPLEX fits into your own applications. In case you prefer to study code online, you'll also find the complete code for these examples in a subdirectory of the standard distribution of ILOG CPLEX.

The following table lists the examples in this manual and indicates where to find them, both online and in the manual:

Example 
Source File 
In This Manual 
dietary optimization: building a model by rows (constraints) or by columns (variables), solving with IloCplex in C++ 
ilodiet.cpp 
Example: Optimizing the Diet Problem in C++ 
dietary optimization: building a model by rows (constraints) or by columns (variables), solving with IloCplex in Java 
Diet.java 
Example: Diet.java Source Code  
dietary optimization: building a model by rows (constraints) or by columns (variables), solving with Cplex in C#.NET 
Diet.cs 
Example: Optimizing the Diet Problem in C#.NET 
dietary optimization: building a model by rows (constraints) or by columns (variables), solving with the Callable Library 
diet.c 
Example: Optimizing the Diet Problem in the Callable Library 
linear programming: starting from an advanced basis 
ilolpex6.cpp 
lpex6.c 
Example ilolpex6.cpp 
Example lpex6.c 
network optimization: using the Callable Library 
netex1.c 
Complete example 
network optimization: relaxing a network flow to an LP 
netex2.c 
Complete example 
quadratic programming: maximizing a QP 
iloqpex1.cpp 
QPex1.java 
qpex1.c 
Example: iloqpex1.cpp 
Complete Program: QPex1.java 
Complete Program: qpex1.c 
quadratic programming: reading a QP from a formatted file 
qpex2.c 
Complete example 
quadratically constrained programming: QCP 
qcpex1.c 
iloqcpex1.cpp 
QCPex1.java 
Examples: QCP 
mixed integer programming: optimizing a basic MIP 
ilomipex1.cpp 
mipex1.c 
Complete Program: ilomipex1.cpp 
Complete Program: mipex1.c 
mixed integer programming: reading a MIP from a formatted file 
ilomipex2.cpp 
mipex2.c 
Complete Program: ilomipex2.cpp 
Complete Program: mipex2.c 
mixed integer programming: using special ordered sets (SOS) and priority orders 
ilomipex3.cpp 
mipex3.c 
Complete Program: ilomipex3.cpp 
Complete Program: mipex3.c 
transport: piecewise-linear optimization 
transport.cpp 
Complete Program: transport.cpp 
food manufacturing 2: using logical constraints 
foodmanufac.cpp 
Example: foodmanufact.cpp 
early tardy scheduling 
etsp.cpp 
Example: etsp.cpp 
input and output: using the message handler 
lpex5.c 
Complete Program: lpex5.c 
using query routines 
lpex7.c 
Example: Using Query Routines lpex7.c 
using callbacks 
ilolpex4.c 
lpex4.c 
iloadmipex5.cpp 
Complete example 
Complete example 
Complete example 

Copyright © 1987-2003 ILOG, S.A. All rights reserved. Legal terms. PREVIOUS NEXT