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
|
# Copyright (c) 1997-2024
# Ewgenij Gawrilow, Michael Joswig, and the polymake team
# Technische Universität Berlin, Germany
# https://polymake.org
#
# This program 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 2, or (at your option) any
# later version: http://www.gnu.org/licenses/gpl.txt.
#
# This program 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.
#-------------------------------------------------------------------------------
CREDIT tosimplex
object Polytope<Rational> {
rule to.integer_points : LATTICE_POINTS_GENERATORS : FACETS | INEQUALITIES, AFFINE_HULL | EQUATIONS {
$this->LATTICE_POINTS_GENERATORS = [to_lattice_points($this), [],[]];
}
precondition : BOUNDED;
weight 5.20;
}
object Polytope {
# It is not necessary to require EQUATIONS or AFFINE_HULL, those are dealt with
# via lookup in the C++ client.
rule to.milp: MILP.MAXIMAL_VALUE, MILP.MAXIMAL_SOLUTION : MILP.LINEAR_OBJECTIVE, FACETS | INEQUALITIES {
to_milp_client($this, $this->MILP, true);
}
precondition : BOUNDED;
weight 3.10;
rule to.milp: MILP.MINIMAL_VALUE, MILP.MINIMAL_SOLUTION : MILP.LINEAR_OBJECTIVE, FACETS | INEQUALITIES {
to_milp_client($this, $this->MILP, false);
}
precondition : BOUNDED;
weight 3.10;
}
# Local Variables:
# cperl-indent-level:3
# mode: perl
# End:
|
