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