/********************************************************
  BCL Example Problems
  ====================

  file xbburgi.c
  ``````````````
  Burglar problem.
  Binary variable formulation with index sets.

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

#include <stdio.h>
#include <stdlib.h>
#include "xprb.h"

/****DATA****/
/* Item:           ca  ne  va  pi  tv  vi  ch  br */
double VALUE[]  = {15,100, 90, 60, 40, 15, 10,  1}; /* Value of items */
double WEIGHT[] = { 2, 20, 20, 30, 40, 30, 60, 10}; /* Weight of items */
double WTMAX    = 102;                  /* Max weight allowed for haul */

char *ITEMNAMES[] = {"camera", "necklace", "vase", "picture", "tv", "video",
            "chest", "brick"};

int NItems;                             /* Number of items */

int main(int argc, char **argv)
{
 XPRBvar *x;
 XPRBidxset ITEMS;                     /* Set of items */
 int i;
 XPRBctr ctr,cobj;
 XPRBprob prob;

 prob=XPRBnewprob("Burglari");          /* Initialize a new problem in BCL */

/****INDICES****/
 ITEMS=XPRBnewidxset(prob,"Items",8);   /* Create the index set */
 for(i=0;i<8;i++) XPRBaddidxel(ITEMS, ITEMNAMES[i]);

 NItems=XPRBgetidxsetsize(ITEMS);       /* Get the size of the index set */

/****VARIABLES****/
 x = (XPRBvar *)malloc(NItems*sizeof(XPRBvar));
 for(i=0;i<NItems;i++)
  x[i]=XPRBnewvar(prob,XPRB_BV, XPRBnewname("x_%s",XPRBgetidxelname(ITEMS,i)),
                  0, 1);                /* 1 if we take item i; 0 otherwise */

/****OBJECTIVE****/
 cobj = XPRBnewctr(prob,"OBJ",XPRB_N);  /* Maximize the total value */
 for(i=0;i<NItems;i++) XPRBaddterm(cobj, x[i], VALUE[i]);
 XPRBsetobj(prob,cobj);                 /* Select objective function */

/****CONSTRAINTS****/
 ctr=XPRBnewctr(prob,"WtMax", XPRB_L);  /* Weight restriction */
 for(i=0;i<NItems;i++)
  XPRBaddterm(ctr, x[i], WEIGHT[i]);
 XPRBaddterm(ctr, NULL, WTMAX);

/****SOLVING + OUTPUT****/
 XPRBsetsense(prob,XPRB_MAXIM);         /* Choose the sense of optimization */
 XPRBmipoptimize(prob,"");              /* Solve the MIP-problem */
 printf("Objective: %g\n",XPRBgetobjval(prob));   /* Get objective value */

 for(i=0;i<NItems;i++)
  if(XPRBgetsol(x[i])>0)
   printf("%s : %g\n", XPRBgetidxelname(ITEMS, i), XPRBgetsol(x[i]));
                                        /* Print out the chosen items */
 return 0;
}