Burglar - Use of index sets, formulating logical constraints

• xbburg: standard formlation
• xbburgi: shows how to index an array of variables by an index set
• xbburgl: adds several indicator constraints to state logical conditions

/********************************************************
  Xpress-BCL Java Example Problems
  ================================

  file xbburg.java
  ````````````````
  Burglar problem, binary variable formulation.

  (c) 2008 Fair Isaac Corporation
      author: S.Heipcke, Jan. 2000, rev. Mar. 2011
********************************************************/

import com.dashoptimization.*;

public class xbburg
{
 static final int NItems = 8;        /* Number of items */

/****DATA****/
/* Item:                           1   2   3   4   5   6   7   8 */
 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 */

 public static void main(String[] args)
 { 
  XPRB bcl;
  XPRBvar[] x;  
  XPRBexpr lobj, kn;  
  int i;
  XPRBprob p;
  
  bcl = new XPRB();                  /* Initialize BCL */
  p = bcl.newProb("Burglar");        /* Create a new problem in BCL */
 
/****VARIABLES****/
  x = new XPRBvar[NItems];           /* 1 if we take item i; 0 otherwise */
  for(i=0;i

/********************************************************
  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;i0) 
    System.out.println(ITEMS.getIndexName(i) + ": " + x[i].getSol());
 }
} 

/********************************************************
  Xpress-BCL Java Example Problems
  ================================

  file xbburgl.java
  `````````````````
  Burglar problem. 
  Binary variable formulation with index sets.
  -- Formulating logical conditions 
     with indicator constraints --

  (c) 2009 Fair Isaac Corporation
      author: S.Heipcke, June 2009, rev. Mar. 2011
********************************************************/

import com.dashoptimization.*;

public class xbburgl
{
/****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;  
  XPRBctr Log3a,Log3b;
  XPRBprob p;
  
  bcl = new XPRB();                  /* Initialize BCL */
  p = bcl.newProb("BurglarL");       /* Create a new problem in BCL */
 
/****INDICES****/
  ITEMS=p.newIndexSet("Items",ITEMNAMES.length);   /* Create the index set */
  for(i=0;i= 2 */

/* Turn the 2 constraints into indicator constraints */
 Log3a.setIndicator(1, x[ITEMS.getIndex("vase")]);
                                  /* x["vase"]=1 -> x["tv"]+x["video"]=0 */
 Log3b.setIndicator(-1, x[ITEMS.getIndex("vase")]);
                                  /* x["vase"]=0 -> x["tv"]+x["video"]=2 */

/* Alternative MIP formulation (instead of Log3a and Log3b) */
/*
 p.newCtr("Log3", 
   x[ITEMS.getIndex("tv")].add(x[ITEMS.getIndex("vase")]).eql(1) );
*/                                            /* x["tv"] = 1 - x["vase"] */
 

/****SOLVING + OUTPUT****/
  p.setSense(XPRB.MAXIM);            /* Choose the sense of the optimization */
  p.mipOptimize("");                 /* Solve the MIP-problem */
  System.out.println("Objective: " + p.getObjVal());  /* Get objective value */

  for(i=0;i0) 
    System.out.println(ITEMS.getIndexName(i) + ": " + x[i].getSol());
 }
}