blob: 0ee47ed96a06fe33583c3718235db5f2266360b9 (
plain)
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
|
/* ckcnf.c (check for CNF-SAT problem instance) */
/***********************************************************************
* 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 "env.h"
#include "prob.h"
int glp_check_cnfsat(glp_prob *P)
{ /* check for CNF-SAT problem instance */
int m = P->m;
int n = P->n;
GLPROW *row;
GLPCOL *col;
GLPAIJ *aij;
int i, j, neg;
#if 0 /* 04/IV-2016 */
if (P == NULL || P->magic != GLP_PROB_MAGIC)
xerror("glp_check_cnfsat: P = %p; invalid problem object\n",
P);
#endif
/* check columns */
for (j = 1; j <= n; j++)
{ col = P->col[j];
/* the variable should be binary */
if (!(col->kind == GLP_IV && col->type == GLP_DB &&
col->lb == 0.0 && col->ub == 1.0))
return 1;
}
/* objective function should be zero */
if (P->c0 != 0.0)
return 2;
for (j = 1; j <= n; j++)
{ col = P->col[j];
if (col->coef != 0.0)
return 3;
}
/* check rows */
for (i = 1; i <= m; i++)
{ row = P->row[i];
/* the row should be of ">=" type */
if (row->type != GLP_LO)
return 4;
/* check constraint coefficients */
neg = 0;
for (aij = row->ptr; aij != NULL; aij = aij->r_next)
{ /* the constraint coefficient should be +1 or -1 */
if (aij->val == +1.0)
;
else if (aij->val == -1.0)
neg++;
else
return 5;
}
/* the right-hand side should be (1 - neg), where neg is the
number of negative constraint coefficients in the row */
if (row->lb != (double)(1 - neg))
return 6;
}
/* congratulations; this is CNF-SAT */
return 0;
}
/* eof */
|
