Examples in Java using Concert Technology
The following examples are delivered with ILOG CPLEX in yourCPLEXhome/examples/src.
AdMIPex1.java uses node and branch callbacks to optimize a MIP; it is comparable to iloadmipex1.cpp.
AdMIPex2.java uses a heuristic callback to optimize a MIP; it is comparable to iloadmipex2.cpp.
AdMIPex3.java uses a branch callback on a MIP with special ordered sets (SOSs); it is comparable to iloadmipex3.cpp.
AdMIPex4.java uses a user-specified cut table in a MIP; it is comparable to iloadmipex4.cpp.
AdMIPex5.java adds cuts through the cut callback for a MIP; it is comparable to iloadmipex5.cpp.
AdMIPex6.java starts a MIP optimization from an LP solution; it is comparable to iloadmipex6.cpp.
Blend.java is a blending problem; it is comparable to blend.cpp.
CplexServer.java shows you how to write an optimization server that accepts a pure Java model taking advantage of the class IloCplexModeler in a native J2EE client application.
CutStock.java is a cutting stock model, illustrating column generation; it is comparable to cutstock.cpp.
Diet.java is an implementation in Java of the classic diet problem; a linear program that can be generated by columns (add foods to the diet) or by rows (add requirements to the diet); it is comparable to ilodiet.cpp.
Etsp.java is an implementation in Java of a scheduling problem with costs for earliness and tardiness.
Facility.java is a warehouse-location problem; it is comparable to facility.cpp.
FixCost1.java is a production planning problem with fixed costs; it is comparable to fixcost1.cpp.
FoodManufact.java implements a solution to the food production planning problem, well known from the modeling textbook of H. P. Williams.
Goalex1.java uses the goal API for branching; it is comparable to ilogoalex1.cpp.
Goalex2.java uses the goal API to add cuts; it is comparable to ilogoalex2.cpp.
Goalex3.java uses the goal API to add node evaluators; it is comparable to ilogoalex3.cpp. it derives from Goalex1.java.
InOut1.java is a production model; it is comparable to inout1.cpp.
InOut3.java is another production model; it is comparable to inout3.cpp.
LPex1.java is a basic linear programming model illustrating data population techniques; it is comparable to ilolpex1.cpp and lpex1.c.
LPex2.java is a basic linear programming model with data coming from files; it is comparable to ilolpex2.cpp and lpex2.c.
LPex3.java shows how to add rows to a model and re-optimize; it is comparable to ilolpex3.cpp and lpex3.c.
LPex4.java illustrates callbacks; it is comparable to ilolpex4.cpp and lpex4.c.
LPex6.java shows how to load a basis; is comparable to ilolpex6.cpp.
LPex7.java shows how to access names of columns; it is comparable to ilolpex7.cpp.
MIPex1.java is a basic MIP model; it is comparable to ilomipex1.cpp.
MIPex2.java is another basic MIP model; it is comparable to ilomipex2.cpp.
MIPex3.java includes special ordered sets (SOSs) in a MIP model; it is comparable to ilomipex3.cpp.
MIQPex1.java is a mixed integer quadratic programming model; it includes a quadratic objective in a MIP; it is comparable to ilomiqpex1.cpp.
MixBlend.java is a MIP blending model; it is comparable to mixblend.cpp.
QPex1.java includes a quadratic objective in an LP; it is comparable to iloqpex1.cpp.
QPex2.java is another model with a quadratic objective; it is comparable to iloqpex2.cpp.
Rates.java is a planning problem with semi-continuous variables; it is comparable to rates.cpp.
Steel.java is a production planning problem illustrating ways to build a model; it is comparable to steel.cpp.
Transport.java uses a piecewise linear cost function; it is comparable to transport.cpp.
Warehouse.java is a warehouse-location problem; it uses goals; it is comparable to warehouse.cpp.
InputDataReader.java is used by several of the examples to read data.