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
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
|
/* MIP_Problem class implementation: inline functions.
Copyright (C) 2001-2010 Roberto Bagnara <bagnara@cs.unipr.it>
Copyright (C) 2010-2011 BUGSENG srl (http://bugseng.com)
This file is part of the Parma Polyhedra Library (PPL).
The PPL 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.
The PPL 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 this program; if not, write to the Free Software Foundation,
Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
For the most up-to-date information see the Parma Polyhedra Library
site: http://www.cs.unipr.it/ppl/ . */
#ifndef PPL_MIP_Problem_inlines_hh
#define PPL_MIP_Problem_inlines_hh 1
#include "Constraint.defs.hh"
#include <stdexcept>
namespace Parma_Polyhedra_Library {
inline dimension_type
MIP_Problem::max_space_dimension() {
return Constraint::max_space_dimension();
}
inline dimension_type
MIP_Problem::space_dimension() const {
return external_space_dim;
}
inline
MIP_Problem::MIP_Problem(const MIP_Problem& y)
: external_space_dim(y.external_space_dim),
internal_space_dim(y.internal_space_dim),
tableau(y.tableau),
working_cost(y.working_cost),
mapping(y.mapping),
base(y.base),
status(y.status),
pricing(y.pricing),
initialized(y.initialized),
input_cs(y.input_cs),
first_pending_constraint(y.first_pending_constraint),
input_obj_function(y.input_obj_function),
opt_mode(y.opt_mode),
last_generator(y.last_generator),
i_variables(y.i_variables) {
PPL_ASSERT(OK());
}
inline
MIP_Problem::~MIP_Problem() {
}
inline void
MIP_Problem::set_optimization_mode(const Optimization_Mode mode) {
if (opt_mode != mode) {
opt_mode = mode;
if (status == UNBOUNDED || status == OPTIMIZED)
status = SATISFIABLE;
PPL_ASSERT(OK());
}
}
inline const Linear_Expression&
MIP_Problem::objective_function() const {
return input_obj_function;
}
inline Optimization_Mode
MIP_Problem::optimization_mode() const {
return opt_mode;
}
inline void
MIP_Problem::optimal_value(Coefficient& num, Coefficient& den) const {
const Generator& g = optimizing_point();
evaluate_objective_function(g, num, den);
}
inline MIP_Problem::const_iterator
MIP_Problem::constraints_begin() const {
return input_cs.begin();
}
inline MIP_Problem::const_iterator
MIP_Problem::constraints_end() const {
return input_cs.end();
}
inline const Variables_Set&
MIP_Problem::integer_space_dimensions() const {
return i_variables;
}
inline MIP_Problem::Control_Parameter_Value
MIP_Problem::get_control_parameter(Control_Parameter_Name name) const {
used(name);
PPL_ASSERT(name == PRICING);
return pricing;
}
inline void
MIP_Problem::set_control_parameter(Control_Parameter_Value value) {
pricing = value;
}
inline void
MIP_Problem::swap(MIP_Problem& y) {
std::swap(external_space_dim, y.external_space_dim);
std::swap(internal_space_dim, y.internal_space_dim);
std::swap(tableau, y.tableau);
std::swap(working_cost, y.working_cost);
std::swap(mapping, y.mapping);
std::swap(initialized, y.initialized);
std::swap(base, y.base);
std::swap(status, y.status);
std::swap(pricing, y.pricing);
std::swap(input_cs, y.input_cs);
std::swap(first_pending_constraint, y.first_pending_constraint);
std::swap(input_obj_function, y.input_obj_function);
std::swap(opt_mode, y.opt_mode);
std::swap(last_generator, y.last_generator);
std::swap(i_variables, y.i_variables);
}
inline MIP_Problem&
MIP_Problem::operator=(const MIP_Problem& y) {
MIP_Problem tmp(y);
swap(tmp);
return *this;
}
inline void
MIP_Problem::clear() {
MIP_Problem tmp;
swap(tmp);
}
inline memory_size_type
MIP_Problem::external_memory_in_bytes() const {
memory_size_type n
= tableau.external_memory_in_bytes()
+ working_cost.external_memory_in_bytes()
+ input_obj_function.external_memory_in_bytes()
+ last_generator.external_memory_in_bytes();
// Adding the external memory for `input_cs'.
n += input_cs.capacity() * sizeof(Constraint);
for (const_iterator i = input_cs.begin(),
i_end = input_cs.end(); i != i_end; ++i)
n += (i->external_memory_in_bytes());
// Adding the external memory for `base'.
n += base.capacity() * sizeof(dimension_type);
// Adding the external memory for `mapping'.
n += mapping.capacity() * sizeof(std::pair<dimension_type, dimension_type>);
return n;
}
inline memory_size_type
MIP_Problem::total_memory_in_bytes() const {
return sizeof(*this) + external_memory_in_bytes();
}
} // namespace Parma_Polyhedra_Library
namespace std {
/*! \relates Parma_Polyhedra_Library::MIP_Problem */
inline void
swap(Parma_Polyhedra_Library::MIP_Problem& x,
Parma_Polyhedra_Library::MIP_Problem& y) {
x.swap(y);
}
} // namespace std
#endif // !defined(PPL_MIP_Problem_inlines_hh)
|
