1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
|
/* rdmip.c (read MIP solution in GLPK format) */
/***********************************************************************
* This code is part of GLPK (GNU Linear Programming Kit).
*
* Copyright (C) 2010-2016 Andrew Makhorin, Department for Applied
* Informatics, Moscow Aviation Institute, Moscow, Russia. All rights
* reserved. E-mail: <mao@gnu.org>.
*
* GLPK is free software: you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* GLPK is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
* License for more details.
*
* You should have received a copy of the GNU General Public License
* along with GLPK. If not, see <http://www.gnu.org/licenses/>.
***********************************************************************/
#include "dimacs.h"
#include "env.h"
#include "misc.h"
#include "prob.h"
/***********************************************************************
* NAME
*
* glp_read_mip - read MIP solution in GLPK format
*
* SYNOPSIS
*
* int glp_read_mip(glp_prob *P, const char *fname);
*
* DESCRIPTION
*
* The routine glp_read_mip reads MIP solution from a text file in GLPK
* format.
*
* RETURNS
*
* If the operation was successful, the routine returns zero. Otherwise
* it prints an error message and returns non-zero. */
int glp_read_mip(glp_prob *P, const char *fname)
{ DMX dmx_, *dmx = &dmx_;
int i, j, k, m, n, sst, ret = 1;
char *stat = NULL;
double obj, *prim = NULL;
#if 0 /* 04/IV-2016 */
if (P == NULL || P->magic != GLP_PROB_MAGIC)
xerror("glp_read_mip: P = %p; invalid problem object\n", P);
#endif
if (fname == NULL)
xerror("glp_read_mip: fname = %d; invalid parameter\n", fname);
if (setjmp(dmx->jump))
goto done;
dmx->fname = fname;
dmx->fp = NULL;
dmx->count = 0;
dmx->c = '\n';
dmx->field[0] = '\0';
dmx->empty = dmx->nonint = 0;
xprintf("Reading MIP solution from '%s'...\n", fname);
dmx->fp = glp_open(fname, "r");
if (dmx->fp == NULL)
{ xprintf("Unable to open '%s' - %s\n", fname, get_err_msg());
goto done;
}
/* read solution line */
dmx_read_designator(dmx);
if (strcmp(dmx->field, "s") != 0)
dmx_error(dmx, "solution line missing or invalid");
dmx_read_field(dmx);
if (strcmp(dmx->field, "mip") != 0)
dmx_error(dmx, "wrong solution designator; 'mip' expected");
dmx_read_field(dmx);
if (!(str2int(dmx->field, &m) == 0 && m >= 0))
dmx_error(dmx, "number of rows missing or invalid");
if (m != P->m)
dmx_error(dmx, "number of rows mismatch");
dmx_read_field(dmx);
if (!(str2int(dmx->field, &n) == 0 && n >= 0))
dmx_error(dmx, "number of columns missing or invalid");
if (n != P->n)
dmx_error(dmx, "number of columns mismatch");
dmx_read_field(dmx);
if (strcmp(dmx->field, "o") == 0)
sst = GLP_OPT;
else if (strcmp(dmx->field, "f") == 0)
sst = GLP_FEAS;
else if (strcmp(dmx->field, "n") == 0)
sst = GLP_NOFEAS;
else if (strcmp(dmx->field, "u") == 0)
sst = GLP_UNDEF;
else
dmx_error(dmx, "solution status missing or invalid");
dmx_read_field(dmx);
if (str2num(dmx->field, &obj) != 0)
dmx_error(dmx, "objective value missing or invalid");
dmx_end_of_line(dmx);
/* allocate working arrays */
stat = xalloc(1+m+n, sizeof(stat[0]));
for (k = 1; k <= m+n; k++)
stat[k] = '?';
prim = xalloc(1+m+n, sizeof(prim[0]));
/* read solution descriptor lines */
for (;;)
{ dmx_read_designator(dmx);
if (strcmp(dmx->field, "i") == 0)
{ /* row solution descriptor */
dmx_read_field(dmx);
if (str2int(dmx->field, &i) != 0)
dmx_error(dmx, "row number missing or invalid");
if (!(1 <= i && i <= m))
dmx_error(dmx, "row number out of range");
if (stat[i] != '?')
dmx_error(dmx, "duplicate row solution descriptor");
stat[i] = GLP_BS;
dmx_read_field(dmx);
if (str2num(dmx->field, &prim[i]) != 0)
dmx_error(dmx, "row value missing or invalid");
dmx_end_of_line(dmx);
}
else if (strcmp(dmx->field, "j") == 0)
{ /* column solution descriptor */
dmx_read_field(dmx);
if (str2int(dmx->field, &j) != 0)
dmx_error(dmx, "column number missing or invalid");
if (!(1 <= j && j <= n))
dmx_error(dmx, "column number out of range");
if (stat[m+j] != '?')
dmx_error(dmx, "duplicate column solution descriptor");
stat[m+j] = GLP_BS;
dmx_read_field(dmx);
if (str2num(dmx->field, &prim[m+j]) != 0)
dmx_error(dmx, "column value missing or invalid");
dmx_end_of_line(dmx);
}
else if (strcmp(dmx->field, "e") == 0)
break;
else
dmx_error(dmx, "line designator missing or invalid");
dmx_end_of_line(dmx);
}
/* store solution components into problem object */
for (k = 1; k <= m+n; k++)
{ if (stat[k] == '?')
dmx_error(dmx, "incomplete MIP solution");
}
P->mip_stat = sst;
P->mip_obj = obj;
for (i = 1; i <= m; i++)
P->row[i]->mipx = prim[i];
for (j = 1; j <= n; j++)
P->col[j]->mipx = prim[m+j];
/* MIP solution has been successfully read */
xprintf("%d lines were read\n", dmx->count);
ret = 0;
done: if (dmx->fp != NULL)
glp_close(dmx->fp);
if (stat != NULL)
xfree(stat);
if (prim != NULL)
xfree(prim);
return ret;
}
/* eof */
|
