Examples in C++ using Concert Technology
The following examples are delivered with ILOG CPLEX in yourCPLEXhome/examples/src.
blend.cpp is a blending problem.
cutstock.cpp is a cutting-stock model illustrating column generation.
etsp.cpp is a scheduling problem with costs for earliness and for tardiness.
facility.cpp is a warehouse-location problem.
fixcost1.cpp is a production planning problem with fixed costs.
foodmanufact.cpp implements a solution to the food production planning problem, well known from the modeling textbook of H. P. Williams.
iloadmipex1.cpp uses node and branch callbacks to optimize a MIP.
iloadmipex2.cpp uses a heuristic callback to optimize a MIP.
iloadmipex3.cpp uses a branch callback on a MIP with special ordered sets (SOS).
iloadmipex4.cpp uses a user-specified cut table for a MIP.
iloadmipex5.cpp adds cuts through the cut callback for a MIP.
iloadmipex6.cpp starts a MIP optimization from an LP solution.
ilodiet.cpp is comparable to diet.c; a linear program that can be generated by columns (add foods to the diet) or by rows (add requirements to the diet).
ilogoalex1.cpp uses the goal API to branch.
ilogoalex2.cpp uses the goal API to add cuts.
ilogoalex3.cpp uses the goal API to add node evaluators; it derives from ilogoalex1.cpp.
ilolpex1.cpp is equivalent to lpex1.c; it shows how to populate data in a model.
ilolpex2.cpp is equivalent to lpex2.c; it shows how to add data from a file.
ilolpex3.cpp is equivalent to lpex3.c; it shows how to add rows to a model and re-optimize.
ilolpex4.cpp is equivalent to lpex4.c; it illustrates callbacks.
ilolpex6.cpp is equivalent to lpex6.c; it shows how to load a basis.
ilolpex7.cpp is equivalent to lpex7.c; it shows how to access names of columns.
ilomipex1.cpp is equivalent to mipex1.c; it is a basic MIP.
ilomipex2.cpp is equivalent to mipex2.c; another basic MIP with data from files.
ilomipex3.cpp is equivalent to mipex3.c; it demonstrates special ordered sets (SOSs) and priorities.
ilomiqpex1.cpp is equivalent to miqpex1.c (quadratic objective in MIP).
iloqpex1.cpp is equivalent to qpex1.c (quadratic objective).
iloqpex2.cpp is equivalent to qpex2.c (quadratic objective).
iloqcpex1.cpp is a quadratically constrained problem.
inout1.cpp is a production model.
inout3.cpp is another production model.
mixblend.cpp is a blending problem with integer variables.
rates.cpp is a planning problem with semi-continuous variables.
steel.cpp is equivalent to rowsteel.c, steeldrv.c, steelsub.c.
transport.cpp uses a piecewise linear cost function.
warehouse.cpp is a warehouse-assignment problem using goals.