Examples in C#.NET using Concert Technology
The following examples are delivered with ILOG CPLEX in yourCPLEXhome\examples.
Blend.cs solves a blending problem, comparable to Blend.java.
CplexServer.cs shows how to enter a problem with the class CplexModeler and how to serialize the model for solving.
CutStock.cs is a cutting stock model, illustrating column generation; it is comparable to Cutstock.java.
Diet.cs is an implementation of the well known diet problem; comparable to Diet.java, this linear program can be generated by columns (add foods to the diet) or by rows (add requirements to the diet).
Etsp.cs demonstrates a scheduling problem with costs for earliness and tardiness.
Facility.cs is a warehouse-location problem, comparable to Facility.java.
FixCost1.cs is a production planning problem with fixed costs; it is comparable to FixCost1.java.
FoodManufact.cs implements a solution to the food production planning problem, well known from the modeling textbook of H. P. Williams.
LPex1.cs is a basic linear programming model illustrating data population techniques; it is comparable to LPex1.java.
LPex2.cs is a basic linear programming model with data coming from files; it is comparable to comparable to LPex2.java.
LPex3.cs shows how to add rows to a model and re-optimize; it is comparable to LPex3.java.
LPex4.cs illustrates callbacks; it is comparable to lpex4.c, ilolpex4.cpp, and LPex4.java.
LPex6.cs shows how to load a basis; is comparable to ilolpex6.cpp and LPex6.java.
LPex7.cs shows how to access names of columns; it is comparable to ilolpex7.cpp and LPex7.java.
MIPex1.cs is a basic MIP model, comparable to MIPex1.java.
MIPex2.cs is another basic MIP model, comparable to MIPex2.java.
MIPex3.cs includes special ordered sets (SOSs) in a MIP model; it is is comparable to MIPex3.java.
MIQPex1.cs is a mixed integer quadratic programming model; it includes a quadratic objective in a MIP model; it is comparable to MIQPex1.java.
MixBlend.cs is a MIP blending model; it is comparable to MixBlend.java.
QPex1.cs includes a quadratic objective in an LP; it is comparable to QPex1.java.
QPex2.cs is another model with a quadratic objective; it is comparable to QPex2.java.
QCPex1.cs is a quadratically constrained problem.
Rates.cs is a planning problem with semi-continuous variables; it is comparable to Rates.java.
Steel.cs is a production planning problem illustrating ways to build a model; it is comparable to Steel.java.
Transport.cs uses a piecewise linear cost function; it is comparable to Transport.java.
Warehouse.cs is a warehouse-location problem; it uses goals; is comparable to Warehouse.java.
Goalex1.cs uses the goal API for branching; it is comparable to ilogoalex1.cpp.
Goalex2.cs uses the goal API to add cuts; it is comparable to ilogoalex2.cpp.
Goalex3.cs uses the goal API to add node evaluators; it is comparable to ilogoalex3.cpp.
AdMIPex1.cs is comparable to AdMIPex1.java and iloadmipex1.cpp. It uses node and branch callbacks to optimize a MIP.
AdMIPex2.cs is comparable to AdMIPex2.java and iloadmipex2.cpp. It uses a heuristic callback to optimize a MIP.
AdMIPex3.cs is comparable to AdMIPex3.java and iloadmipex3.cpp. It uses a branch callback on a MIP with special ordered sets (SOSs).
AdMIPex4.cs is comparable to AdMIPex4.java and iloadmipex4.cpp. It uses a user-specified cut table for a MIP.
AdMIPex5.cs adds cuts through the cut callback of a MIP; it is comparable to AdMIPex5.java.
AdMIPex6.cs starts a MIP optimization from an LP solution; it is comparable to AdMIPex6.java.