/*****************************************************************/
/*                                                               */
/* Program to Convert the MLND Input                             */
/* Into the Cplex Input                                          */
/*                                                               */
/* Author: Frederico R. B. da Cruz                               */
/*         Departamento de Ciencia da Computacao                 */
/*         Universidade Federal de Minas Gerais                  */
/*         Brazil                                                */
/*                                                               */
/* E-mail: fcruz@dcc.ufmg.br                                     */
/*                                                               */
/* Version: 1.00                                                 */
/*                                                               */
/* Date: Apr/97                                                  */
/*                                                               */
/*****************************************************************/

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

#include "ty.h"
#include "io.c"

int main( int argc, char *argv[] ) {

  int               n_Nodes, n_Levels, i, j, l, cont;
  ListArcPtrType    *AdjaNodInd, ListArcPtr;
  ListNodPtrType    *DemaNodLev, DemaNodPtr, ListNodPtr, ListNodPtr2;
  ListNodPtrType    *RootNodLev;
  MlType            *Ml;
  float             Flow;

  if ( argc < 3 ) {
     fprintf(ERRFILE, "Usage: m2c <model> ('s'ingle or 'm'ulticommodity) <option> ('m'ip or 'l'inear)\n");
     exit(0);
  }
  else if ((argv[1][0]!='s')&&(argv[1][0]!='m')) {
     fprintf(ERRFILE, "Usage: m2c <model> ('s'ingle or 'm'ulticommodity) <option> ('m'ip or 'l'inear)\n");
     exit(0);
  }
  else if ((argv[2][0]!='m')&&(argv[2][0]!='l')) {
     fprintf(ERRFILE, "Usage: m2c <model> ('s'ingle or 'm'ulticommodity) <option> ('m'ip or 'l'inear)\n");
     exit(0);
  }

  /* read data */
  ReadData(INFILE,&n_Nodes, &n_Levels, &AdjaNodInd, &DemaNodLev, &RootNodLev );
/*
  if ( n_Levels > 1 ) {
     fprintf(ERRFILE,
     "Error in input file: number of levels must be equal to 1\n");
     exit(0);
  }
*/
  /* initialize Ml vector */
  Ml = (MlPtrType) calloc( n_Levels, sizeof(MlType));
  Flow = 0;
  for ( l = n_Levels-1; l >= 0; l-- ) {
      DemaNodPtr = DemaNodLev[l];
      while (DemaNodPtr != NULL) {
            Flow += DemaNodPtr->NPtr->di;
            DemaNodPtr = DemaNodPtr->Next;
      }
      Ml[l] = Flow;
  }

  /* create Cplex output */
  if ( argv[1][0] == 's' ) {
     /* objective function */
     fprintf(OUTFILE, "Minimize\n");
     for ( l = 0; l < n_Levels; l++ ) {
       for ( i = 0; i < n_Nodes; i++ ) {
           ListArcPtr = AdjaNodInd[i];
           if (ListArcPtr != NULL) {
              while (ListArcPtr != NULL) {
                 fprintf(OUTFILE, "+ %4.0f x_%1d_%03d_%03d ",
                         ListArcPtr->APtr[l]->cij,
                         l+1,
                         ListArcPtr->APtr[l]->i+1,
                         ListArcPtr->APtr[l]->j+1);
                 ListArcPtr = ListArcPtr->Next;
              }
              fprintf(OUTFILE,"\n");
           }
       }
       for ( i = 0; i < n_Nodes; i++ ) {
           ListArcPtr = AdjaNodInd[i];
           if (ListArcPtr != NULL) {
              while (ListArcPtr != NULL) {
                 fprintf(OUTFILE, "+ %4.0f y_%1d_%03d_%03d ",
                         ListArcPtr->APtr[l]->fij,
                         l+1,
                         ListArcPtr->APtr[l]->i+1,
                         ListArcPtr->APtr[l]->j+1);
                 ListArcPtr = ListArcPtr->Next;
              }
              fprintf(OUTFILE,"\n");
           }
       }
       ListNodPtr = RootNodLev[l];
       while (ListNodPtr != NULL) {
          fprintf(OUTFILE, "+ %4.0f z_%03d\n",
                  ListNodPtr->NPtr->fi,
                  ListNodPtr->NPtr->i+1);
          ListNodPtr = ListNodPtr->Next;
       }
       fprintf(OUTFILE,"\n");
     }
     fprintf(OUTFILE, "Subject To\n");
     /* source node constraints */
     l = 0;
     ListNodPtr = RootNodLev[l];
     while (ListNodPtr != NULL) {
        for ( j = 0; j < n_Nodes; j++ ) {
            ListArcPtr = AdjaNodInd[j];
            while (ListArcPtr != NULL) {
                if ( ListArcPtr->APtr[l]->j == ListNodPtr->NPtr->i )
                   fprintf(OUTFILE, "+ x_%1d_%03d_%03d ",
                           l+1,
                           ListArcPtr->APtr[l]->i+1,
                           ListArcPtr->APtr[l]->j+1);
                ListArcPtr = ListArcPtr->Next;
            }
        }
        /* fprintf(OUTFILE, "\n" ); */
        ListArcPtr = AdjaNodInd[ListNodPtr->NPtr->i];
        while (ListArcPtr != NULL) {
           fprintf(OUTFILE, "- x_%1d_%03d_%03d ",
                   l+1,
                   ListArcPtr->APtr[l]->i+1,
                   ListArcPtr->APtr[l]->j+1);
           ListArcPtr = ListArcPtr->Next;
        }
        fprintf(OUTFILE,"= - %4.0f\n", Ml[l]);
        ListNodPtr = ListNodPtr->Next;
     }
     for ( l = 1; l < n_Levels; l++ ) {
       ListNodPtr = RootNodLev[l];
       while (ListNodPtr != NULL) {
          for ( j = 0; j < n_Nodes; j++ ) {
              ListArcPtr = AdjaNodInd[j];
              while (ListArcPtr != NULL) {
                  if ( ListArcPtr->APtr[l]->j == ListNodPtr->NPtr->i )
                     fprintf(OUTFILE, "+ x_%1d_%03d_%03d ",
                             l+1,
                             ListArcPtr->APtr[l]->i+1,
                             ListArcPtr->APtr[l]->j+1);
                  ListArcPtr = ListArcPtr->Next;
              }
          }
          fprintf(OUTFILE, "\n" );
          ListArcPtr = AdjaNodInd[ListNodPtr->NPtr->i];
          while (ListArcPtr != NULL) {
             fprintf(OUTFILE, "- x_%1d_%03d_%03d ",
                     l+1,
                     ListArcPtr->APtr[l]->i+1,
                     ListArcPtr->APtr[l]->j+1);
             ListArcPtr = ListArcPtr->Next;
          }
          fprintf(OUTFILE, "\n" );
          for ( j = 0; j < n_Nodes; j++ ) {
              ListArcPtr = AdjaNodInd[j];
              while (ListArcPtr != NULL) {
                  if ( ListArcPtr->APtr[l-1]->j == ListNodPtr->NPtr->i )
                     fprintf(OUTFILE, "+ x_%1d_%03d_%03d ",
                             l+1-1,
                             ListArcPtr->APtr[l]->i+1,
                             ListArcPtr->APtr[l]->j+1);
                  ListArcPtr = ListArcPtr->Next;
              }
          }
          fprintf(OUTFILE, "\n" );
          ListArcPtr = AdjaNodInd[ListNodPtr->NPtr->i];
          while (ListArcPtr != NULL) {
             fprintf(OUTFILE, "- x_%1d_%03d_%03d ",
                     l+1-1,
                     ListArcPtr->APtr[l]->i+1,
                     ListArcPtr->APtr[l]->j+1);
                ListArcPtr = ListArcPtr->Next;
             }
          fprintf(OUTFILE, "=      0\n");
          ListNodPtr = ListNodPtr->Next;
       }
     }
     /* transshipment node constraints */
     for ( l = 0; l < n_Levels; l++ ) {
       for ( i = 0; i < n_Nodes; i++ ) {
         ListNodPtr = DemaNodLev[l];
         while ( (ListNodPtr != NULL)&&( ListNodPtr->NPtr->i != i ) )
               ListNodPtr = ListNodPtr->Next;
         /* if node isn't in demand node set then ... */
         if (ListNodPtr == NULL) {
           ListNodPtr = RootNodLev[l];
           while ( (ListNodPtr != NULL)&&( ListNodPtr->NPtr->i != i ) )
                 ListNodPtr = ListNodPtr->Next;
           /* if node isn't in l-th level supply node set then ... */
           if (ListNodPtr == NULL) {
              if ( (l+1) < n_Levels ) {
                 ListNodPtr = RootNodLev[l+1];
                 while ( (ListNodPtr != NULL)&&( ListNodPtr->NPtr->i != i ) )
                       ListNodPtr = ListNodPtr->Next;
              }
              /* if node isn't in (l+1)-th level supply node set then .. */
              if (ListNodPtr == NULL) {
                 for ( j = 0; j < n_Nodes; j++ ) {
                     ListArcPtr = AdjaNodInd[j];
                     while (ListArcPtr != NULL) {
                       if ( ListArcPtr->APtr[l]->j == i )
                          fprintf(OUTFILE, "+ x_%1d_%03d_%03d ",
                                  l+1,
                                  ListArcPtr->APtr[l]->i+1,
                                  ListArcPtr->APtr[l]->j+1);
                       ListArcPtr = ListArcPtr->Next;
                     }
                 }
                 /* fprintf(OUTFILE, "\n" ); */
                 ListArcPtr = AdjaNodInd[i];
                 while (ListArcPtr != NULL) {
                   fprintf(OUTFILE, "- x_%1d_%03d_%03d ",
                           l+1,
                           ListArcPtr->APtr[l]->i+1,
                           ListArcPtr->APtr[l]->j+1);
                   ListArcPtr = ListArcPtr->Next;
                 }
                 fprintf(OUTFILE, "=      0\n");
              }
           }
         }
       }
     }
     /* demand node constraints */
     for ( l = 0; l < n_Levels; l++ ) {
       ListNodPtr = DemaNodLev[l];
       while (ListNodPtr != NULL) {
         for ( j = 0; j < n_Nodes; j++ ) {
           ListArcPtr = AdjaNodInd[j];
           while (ListArcPtr != NULL) {
             if ( ListArcPtr->APtr[l]->j == ListNodPtr->NPtr->i )
                fprintf(OUTFILE, "+ x_%1d_%03d_%03d ",
                        l+1,
                        ListArcPtr->APtr[l]->i+1,
                        ListArcPtr->APtr[l]->j+1);
             ListArcPtr = ListArcPtr->Next;
           }
         }
         /* fprintf(OUTFILE, "\n" ); */
         ListArcPtr = AdjaNodInd[ListNodPtr->NPtr->i];
         while (ListArcPtr != NULL) {
           fprintf(OUTFILE, "- x_%1d_%03d_%03d ",
                   l+1,
                   ListArcPtr->APtr[l]->i+1,
                   ListArcPtr->APtr[l]->j+1);
           ListArcPtr = ListArcPtr->Next;
         }
         fprintf(OUTFILE, "=   %4.0f\n", ListNodPtr->NPtr->di);
         ListNodPtr = ListNodPtr->Next;
       }
     }
     /* coupling constraints I */
     for ( l = 0; l < n_Levels; l++ ) {
       ListNodPtr = RootNodLev[l];
       while (ListNodPtr != NULL) {
          for ( j = 0; j < n_Nodes; j++ ) {
            ListArcPtr = AdjaNodInd[j];
            while (ListArcPtr != NULL) {
              if ( ListArcPtr->APtr[l]->j == ListNodPtr->NPtr->i )
                 fprintf(OUTFILE, "+ x_%1d_%03d_%03d ",
                         l+1,
                         ListArcPtr->APtr[l]->i+1,
                         ListArcPtr->APtr[l]->j+1);
              ListArcPtr = ListArcPtr->Next;
            }
          }
          /* fprintf(OUTFILE, "\n" ); */
          ListArcPtr = AdjaNodInd[ListNodPtr->NPtr->i];
          while (ListArcPtr != NULL) {
            fprintf(OUTFILE, "- x_%1d_%03d_%03d ",
                    l+1,
                    ListArcPtr->APtr[l]->i+1,
                    ListArcPtr->APtr[l]->j+1);
            ListArcPtr = ListArcPtr->Next;
          }
          fprintf(OUTFILE, "+ %4.0f z_%03d >=      0\n", 
                  Ml[l], ListNodPtr->NPtr->i+1);
          ListNodPtr = ListNodPtr->Next;
       }
     }
     /* coupling constraints II */
     for ( l = 0; l < n_Levels; l++ ) {
       for ( i = 0; i < n_Nodes; i++ ) {
         ListArcPtr = AdjaNodInd[i];
         while (ListArcPtr != NULL) {
            fprintf(OUTFILE, "- x_%1d_%03d_%03d ",
                    l+1,
                    ListArcPtr->APtr[l]->i+1,
                    ListArcPtr->APtr[l]->j+1);
            fprintf(OUTFILE, "+ %4.0f y_%1d_%03d_%03d >=     0\n",
                    Ml[l],
                    l+1,
                    ListArcPtr->APtr[l]->i+1,
                    ListArcPtr->APtr[l]->j+1);
            ListArcPtr = ListArcPtr->Next;
         }
       }
     }
     /* bound constraints */
     fprintf(OUTFILE, "Bounds\n");
     for ( l = 0; l < n_Levels; l++ ) {
       for ( i = 0; i < n_Nodes; i++ ) {
         ListArcPtr = AdjaNodInd[i];
         while (ListArcPtr != NULL) {
            fprintf(OUTFILE, "0 <= y_%1d_%03d_%03d <= 1\n",
                    l+1,
                    ListArcPtr->APtr[l]->i+1,
                    ListArcPtr->APtr[l]->j+1);
            ListArcPtr = ListArcPtr->Next;
         }
       }
     }
     for ( l = 0; l < n_Levels; l++ ) {
       ListNodPtr = RootNodLev[l];
       while (ListNodPtr != NULL) {
          fprintf(OUTFILE, "0 <= z_%03d <= 1\n",
                  ListNodPtr->NPtr->i+1);
          ListNodPtr = ListNodPtr->Next;
       }
     }
     /* integer variables */
     if ( argv[2][0] == 'm' ) {
       fprintf(OUTFILE, "Integers\n");
       for ( l = 0; l < n_Levels; l++ ) {
          for ( i = 0; i < n_Nodes; i++ ) {
            ListArcPtr = AdjaNodInd[i];
            while (ListArcPtr != NULL) {
               fprintf(OUTFILE, "y_%1d_%03d_%03d\n",
                       l+1,
                       ListArcPtr->APtr[l]->i+1,
                       ListArcPtr->APtr[l]->j+1);
               ListArcPtr = ListArcPtr->Next;
            }
          }
        }
        for ( l = 0; l < n_Levels; l++ ) {
          ListNodPtr = RootNodLev[l];
          while (ListNodPtr != NULL) {
             fprintf(OUTFILE, "z_%03d\n",
                     ListNodPtr->NPtr->i+1);
             ListNodPtr = ListNodPtr->Next;
          }
        }
     }
     /* the end */
     fprintf(OUTFILE, "End\n" );
  } else if ( argv[1][0] == 'm' )  {
     fprintf(OUTFILE, "Minimize\n");
     cont = 0;
     for ( i = 0; i < n_Nodes; i++ ) {
         ListArcPtr = AdjaNodInd[i];
         if (ListArcPtr != NULL) {
            while (ListArcPtr != NULL) {
               fprintf(OUTFILE, "+ %4.0f   x_%03d_%03d ",
                    ListArcPtr->APtr[0]->cij,
                    ListArcPtr->APtr[0]->i+1,
                    ListArcPtr->APtr[0]->j+1);
               if ( ( ++cont % 5 ) == 0 ) fprintf(OUTFILE,"\n");
               ListArcPtr = ListArcPtr->Next;
            }
         }
     }
     fprintf(OUTFILE,"\n");
     cont = 0;
     for ( i = 0; i < n_Nodes; i++ ) {
         ListArcPtr = AdjaNodInd[i];
         if (ListArcPtr != NULL) {
            while (ListArcPtr != NULL) {
               fprintf(OUTFILE, "+ %4.0f   y_%03d_%03d ",
                    ListArcPtr->APtr[0]->fij,
                    ListArcPtr->APtr[0]->i+1,
                    ListArcPtr->APtr[0]->j+1);
               if ( ( ++cont % 5 ) == 0 ) fprintf(OUTFILE,"\n");
               ListArcPtr = ListArcPtr->Next;
            }
         }
     }
     fprintf(OUTFILE,"\n");
     fprintf(OUTFILE, "Subject to\n");
     l = 0;
     ListNodPtr2 = DemaNodLev[l];
     while (ListNodPtr2 != NULL) {
       /* source node constraints */
       cont = 0;
       l = 0;
       ListNodPtr = RootNodLev[l];
       while (ListNodPtr != NULL) {
          for ( j = 0; j < n_Nodes; j++ ) {
              ListArcPtr = AdjaNodInd[j];
              while (ListArcPtr != NULL) {
                  if ( ListArcPtr->APtr[0]->j == ListNodPtr->NPtr->i ) {
                     fprintf(OUTFILE, "+ w_%03d_%03d_%03d ",
                             ListNodPtr2->NPtr->i+1,
                             ListArcPtr->APtr[0]->i+1,
                             ListArcPtr->APtr[0]->j+1);
                     if ( ( ++cont % 5 ) == 0 ) fprintf(OUTFILE,"\n");
                  }
                  ListArcPtr = ListArcPtr->Next;
              }
          }
          ListArcPtr = AdjaNodInd[ListNodPtr->NPtr->i];
          while (ListArcPtr != NULL) {
             fprintf(OUTFILE, "- w_%03d_%03d_%03d ",
                     ListNodPtr2->NPtr->i+1,
                     ListArcPtr->APtr[0]->i+1,
                     ListArcPtr->APtr[0]->j+1);
             if ( ( ++cont % 5 ) == 0 ) fprintf(OUTFILE,"\n");
             ListArcPtr = ListArcPtr->Next;
          }
          fprintf(OUTFILE," = -%4.0f\n", ListNodPtr2->NPtr->di );
          cont = 0;
          ListNodPtr = ListNodPtr->Next;
       }
       /* transshipment node constraints */
       cont = 0;
       for ( i = 0; i < n_Nodes; i++ ) {
          if ( i != ListNodPtr2->NPtr->i ) {
             ListNodPtr = RootNodLev[l];
             while ( (ListNodPtr != NULL)&&( ListNodPtr->NPtr->i != i ) )
                   ListNodPtr = ListNodPtr->Next;
             if (ListNodPtr == NULL) { 
               for ( j = 0; j < n_Nodes; j++ ) {
                   ListArcPtr = AdjaNodInd[j];
                   while (ListArcPtr != NULL) {
                      if ( ListArcPtr->APtr[0]->j == i ) {
                         fprintf(OUTFILE, "+ w_%03d_%03d_%03d ",
                                 ListNodPtr2->NPtr->i+1,
                                 ListArcPtr->APtr[0]->i+1,
                                 ListArcPtr->APtr[0]->j+1);
                         if ( ( ++cont % 5 ) == 0 ) fprintf(OUTFILE,"\n");
                      }
                      ListArcPtr = ListArcPtr->Next;
                   }
               }
               ListArcPtr = AdjaNodInd[i];
               while (ListArcPtr != NULL) {
                  fprintf(OUTFILE, "- w_%03d_%03d_%03d ",
                          ListNodPtr2->NPtr->i+1,
                          ListArcPtr->APtr[0]->i+1,
                          ListArcPtr->APtr[0]->j+1);
                  if ( ( ++cont % 5 ) == 0 ) fprintf(OUTFILE,"\n");
                  ListArcPtr = ListArcPtr->Next;
               }
               fprintf(OUTFILE," = 0\n");
               cont = 0;
             }
          }
       }
       /* demand node constraints */
       cont = 0;
       for ( j = 0; j < n_Nodes; j++ ) {
           ListArcPtr = AdjaNodInd[j];
           while (ListArcPtr != NULL) {
               if ( ListArcPtr->APtr[0]->j == ListNodPtr2->NPtr->i ) {
                  fprintf(OUTFILE, "+ w_%03d_%03d_%03d ",
                          ListNodPtr2->NPtr->i+1,
                          ListArcPtr->APtr[0]->i+1,
                          ListArcPtr->APtr[0]->j+1);
                  if ( ( ++cont % 5 ) == 0 ) fprintf(OUTFILE,"\n");
               }
               ListArcPtr = ListArcPtr->Next;
           }
       }
       ListArcPtr = AdjaNodInd[ListNodPtr2->NPtr->i];
       while (ListArcPtr != NULL) {
          fprintf(OUTFILE, "- w_%03d_%03d_%03d ",
                  ListNodPtr2->NPtr->i+1,
                  ListArcPtr->APtr[0]->i+1,
                  ListArcPtr->APtr[0]->j+1);
          if ( ( ++cont % 5 ) == 0 ) fprintf(OUTFILE,"\n");
          ListArcPtr = ListArcPtr->Next;
       }
       fprintf(OUTFILE," = %4.0f\n", ListNodPtr2->NPtr->di);
       cont = 0;
       ListNodPtr2 = ListNodPtr2->Next;
     }
     /* coupling constraints I */
     cont = 0;
     for ( i = 0; i < n_Nodes; i++ ) {
         ListArcPtr = AdjaNodInd[i];
         while (ListArcPtr != NULL) {
            l = 0;
            ListNodPtr2 = DemaNodLev[l];
            while (ListNodPtr2 != NULL) {
               fprintf(OUTFILE, "+ w_%03d_%03d_%03d ",
                       ListNodPtr2->NPtr->i+1,
                       ListArcPtr->APtr[0]->i+1,
                       ListArcPtr->APtr[0]->j+1 );
               if ( ( ++cont % 5 ) == 0 ) fprintf(OUTFILE,"\n");
               ListNodPtr2 = ListNodPtr2->Next;
            }
            fprintf(OUTFILE, "- x_%03d_%03d <= 0\n",
                    ListArcPtr->APtr[0]->i+1,
                    ListArcPtr->APtr[0]->j+1 );
            cont = 0;
            ListArcPtr = ListArcPtr->Next;
        }
     }
     /* coupling constraints II */
     l = 0;
     ListNodPtr2 = DemaNodLev[l];
     while (ListNodPtr2 != NULL) {
        for ( i = 0; i < n_Nodes; i++ ) {
            ListArcPtr = AdjaNodInd[i];
            while (ListArcPtr != NULL) {
               fprintf(OUTFILE, "w_%03d_%03d_%03d - %4.0f y_%03d_%03d <= 0\n",
                       ListNodPtr2->NPtr->i+1,
                       ListArcPtr->APtr[0]->i+1,
                       ListArcPtr->APtr[0]->j+1,
                       ListNodPtr2->NPtr->di,
                       ListArcPtr->APtr[0]->i+1,
                       ListArcPtr->APtr[0]->j+1);
               ListArcPtr = ListArcPtr->Next;
            }
        }
        ListNodPtr2 = ListNodPtr2->Next;
     }
     /* bound constraints */
     fprintf(OUTFILE, "Bounds\n");
     for ( i = 0; i < n_Nodes; i++ ) {
         ListArcPtr = AdjaNodInd[i];
         while (ListArcPtr != NULL) {
            fprintf(OUTFILE, "0 <= y_%03d_%03d <= 1\n",
                    ListArcPtr->APtr[0]->i+1,
                    ListArcPtr->APtr[0]->j+1);
            ListArcPtr = ListArcPtr->Next;
         }
     }
     /* integer variables */
     if ( argv[2][0] == 'm' ) {
        fprintf(OUTFILE, "Integers\n");
        for ( i = 0; i < n_Nodes; i++ ) {
            ListArcPtr = AdjaNodInd[i];
            while (ListArcPtr != NULL) {
               fprintf(OUTFILE, "y_%03d_%03d\n",
                       ListArcPtr->APtr[0]->i+1,
                       ListArcPtr->APtr[0]->j+1);
               ListArcPtr = ListArcPtr->Next;
            }
        }
     }
     /* the end */
     fprintf(OUTFILE, "End\n" );
  }

    /* free everything */
  FreeData(n_Nodes, n_Levels, AdjaNodInd, DemaNodLev, RootNodLev );
  free(Ml);
  return(0);
}