Problem:    Indtransport
Rows:       35
Columns:    15 (15 integer, 12 binary)
Non-zeros:  93
Status:     INTEGER OPTIMAL
Objective:  objekt = 27005 (MAXimum)

   No.   Row name        Activity     Lower bound   Upper bound
------ ------------    ------------- ------------- -------------
     1 objekt                  27005                             
     2 bedrift_besoeg[1]
                               -9799                          -0 
     3 bedrift_besoeg[2]
                               -9849                          -0 
     4 bedrift_besoeg[3]
                               -9849                          -0 
     5 lev_eft                   500           500             = 
     6 maks_lev[1]               200                         200 
     7 maks_lev[2]               150                         150 
     8 maks_lev[3]               150                         200 
     9 antal_ture                  1             1             = 
    10 kun_besoegte[1,1]
                                  -1                          -0 
    11 kun_besoegte[1,2]
                                  -1                          -0 
    12 kun_besoegte[1,3]
                                   0                          -0 
    13 kun_besoegte[2,1]
                                   0                          -0 
    14 kun_besoegte[2,2]
                                  -1                          -0 
    15 kun_besoegte[2,3]
                                  -1                          -0 
    16 kun_besoegte[3,1]
                                  -1                          -0 
    17 kun_besoegte[3,2]
                                  -1                          -0 
    18 kun_besoegte[3,3]
                                  -1                          -0 
    19 ikke_fra_til_samme[1,1]
                                   0                           1 
    20 ikke_fra_til_samme[1,2]
                                   1                           1 
    21 ikke_fra_til_samme[1,3]
                                   1                           1 
    22 ikke_fra_til_samme[2,1]
                                   1                           1 
    23 ikke_fra_til_samme[2,2]
                                   0                           1 
    24 ikke_fra_til_samme[2,3]
                                   0                           1 
    25 ikke_fra_til_samme[3,1]
                                   1                           1 
    26 ikke_fra_til_samme[3,2]
                                   0                           1 
    27 ikke_fra_til_samme[3,3]
                                   0                           1 
    28 kun_en_gang_til[1]
                                   1                           1 
    29 kun_en_gang_til[2]
                                   0                           1 
    30 kun_en_gang_til[3]
                                   1                           1 
    31 kun_en_gang_fra[1]
                                   1                           1 
    32 kun_en_gang_fra[2]
                                   1                           1 
    33 kun_en_gang_fra[3]
                                   0                           1 
    34 laesser_start_01
                                   1             1             = 
    35 laesser_start_02
                                   0            -0             = 

   No. Column name       Activity     Lower bound   Upper bound
------ ------------    ------------- ------------- -------------
     1 b[1]         *              1             0             1 
     2 b[2]         *              1             0             1 
     3 b[3]         *              1             0             1 
     4 x[1]         *            200             0               
     5 x[2]         *            150             0               
     6 x[3]         *            150             0               
     7 m[1,1]       *              0             0             1 
     8 m[1,2]       *              0             0             1 
     9 m[1,3]       *              1             0             1 
    10 m[2,1]       *              1             0             1 
    11 m[2,2]       *              0             0             1 
    12 m[2,3]       *              0             0             1 
    13 m[3,1]       *              0             0             1 
    14 m[3,2]       *              0             0             1 
    15 m[3,3]       *              0             0             1 

Integer feasibility conditions:

KKT.PE: max.abs.err = 0.00e+00 on row 0
        max.rel.err = 0.00e+00 on row 0
        High quality

KKT.PB: max.abs.err = 0.00e+00 on row 0
        max.rel.err = 0.00e+00 on row 0
        High quality

End of output