/******************************************************** Xpress-BCL Java Example Problems ================================ file xbburgi.java ````````````````` Burglar problem. Binary variable formulation with index sets. (c) 2008 Fair Isaac Corporation author: S.Heipcke, Jan. 2000, rev. Mar. 2011 ********************************************************/ import com.dashoptimization.*; public class xbburgi { /****DATA****/ /* Item: ca ne va pi tv vi ch br */ static final double[] VALUE = {15,100, 90, 60, 40, 15, 10, 1}; /* Value of items */ static final double[] WEIGHT = { 2, 20, 20, 30, 40, 30, 60, 10}; /* Weight of items */ static final double WTMAX = 102; /* Max weight allowed for haul */ static final String[] ITEMNAMES = {"camera", "necklace", "vase", "picture", "tv", "video", "chest", "brick"}; static int NItems; /* Number of items */ public static void main(String[] args) { XPRB bcl; XPRBvar[] x; XPRBindexSet ITEMS; /* Set of items */ int i; XPRBexpr lobj, kn; XPRBprob p; bcl = new XPRB(); /* Initialize BCL */ p = bcl.newProb("Burglari"); /* Create a new problem in BCL */ /****INDICES****/ ITEMS=p.newIndexSet("Items",ITEMNAMES.length); /* Create the index set */ for(i=0;i<ITEMNAMES.length;i++) NItems=ITEMS.getSize(); Get the size of index set x=new for(i=0;i<NItems;i++) x[i]=p.newVar("x_"+ITEMS.getIndexName(i), if we take item otherwise lobj=new Set objective: maximize total value kn=new Weight restriction Choose sense optimization Solve MIP-problem>0) 
    System.out.println(ITEMS.getIndexName(i) + ": " + x[i].getSol());
 }
}