/******************************************************** BCL Example Problems ==================== file xbscenar.c ``````````````` Different demand scenarios implemented with multiple threads. Win32 version (c) 2008-2023 Fair Isaac Corporation author: S. Heipcke, 2001, rev. Mar. 2011 ********************************************************/ #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <windows.h>
#include "xprb.h"

#define NSCENARIO 4              /* Number of demand scenarios */

#define MaxSuppliers 50          /* Max. number of suppliers */
#define MaxCustomers 50          /* Max. number of customers */
#define MaxArcs 100              /* Max. number of non-zero cost values */

#define DEMANDFILE XPRBDATAPATH "/trans/ex2dem"  
                                 /* Demand data file (name completed below) */
#define AVAILFILE XPRBDATAPATH "/trans/ex2avail.dat" 
                                 /* Supply data file */
#define COSTFILE XPRBDATAPATH "/trans/ex2cost.dat"   
                                 /* Cost data file */

struct Costarcs{
        int suppl;
        int custm;
        double value;
};

DWORD WINAPI trans(LPVOID param);
void XPRB_CC userprint(XPRBprob prob, void *file, const char *msg);   

/***********************************************************************/

/**********************/
/* Where things start */
/**********************/
int main(int argc,char *argv[])
{
 HANDLE tosolve[NSCENARIO];
 int i;

 XPRBinit();                     /* Initialize BCL */

 /* Start the building+solving in parallel */
 for(i=0;i<NSCENARIO;i++) tosolve[i]=CreateThread(NULL, Wait for results for(i=0;i<NSCENARIO;i++) Clear up everything really required here since the program terminates immediately return DWORD WINAPI double FILE char XPRBidxset Set of suppliers customers Availability products Demand by struct Costarcs Cost per supplier-customer pair int NSuppl=0,NCustom=0, NArc=0; Actual numbers and arcs XPRBctr XPRBvar XPRBprob sprintf(name,="Trans_%d" prob=XPRBnewprob(name); Initialize a new problem in BCL strcat(name,="_out.txt" outfile=fopen(name, Redirect output to file: comment this line out get all display on screen Create supplier customer index sets Suppliers=XPRBnewidxset(prob,"suppl",MaxSuppliers); Customers=XPRBnewidxset(prob,"custom",MaxCustomers); Read demand data file datafile=fopen(name while 200,="T,g" &value)== DEMAND[XPRBaddidxel(Customers,name1)]=value; NCustom=XPRBgetidxsetsize(Customers); supply AVAIL[XPRBaddidxel(Suppliers,name1)]=value; cost COST[NArc].suppl=XPRBgetidxel(Suppliers, COST[NArc].custm=XPRBgetidxel(Customers, COST[NArc++].value=value; x=(XPRBvar if(x==NULL) memory variables for(a=0; x[a]=XPRBnewvar(prob,XPRB_PL,"x",0,XPRB_INFINITY); cobj=XPRBnewctr(prob,"OBJ", Select objective function constraints single loop av=(XPRBctr if(av==NULL) enough AV de=(XPRBctr if(de==NULL) DE for(s=0; av[s]=XPRBnewctr(prob,"Avail", for(c=0; de[c]=XPRBnewctr(prob,"Demand", Add elements one-by-one Terminate constraint definition Choose sense optimization Solve LP-problem if(XPRBgetlpstat(prob)== XPRBprintf(prob,="Problem %s Objective: %g\n" Print value solution values>0)
   XPRBprintf(prob, "%s (%g) -> %s (%g): %g\n", 
     XPRBgetidxelname(Suppliers,COST[a].suppl),
     AVAIL[COST[a].suppl],
     XPRBgetidxelname(Customers,COST[a].custm), 
     DEMAND[COST[a].custm], XPRBgetsol(x[a]));  
 }
 else
  XPRBprintf(prob, "Problem %s is infeasible\n", XPRBgetprobname(prob));

 free(x);
 free(av);
 free(de);
 XPRBdelprob(prob);

 fclose(outfile);
 
 return 0;
}

void XPRB_CC userprint(XPRBprob prob, void *file, const char *msg)
{
    /* Print output of each example into a different file */ 
  fprintf((FILE *)file, "%s", msg);
}