marci@1031
|
1 |
// -*- c++ -*-
|
marci@1031
|
2 |
#ifndef LEMON_LP_SOLVER_WRAPPER_H
|
marci@1031
|
3 |
#define LEMON_LP_SOLVER_WRAPPER_H
|
marci@1031
|
4 |
|
marci@1031
|
5 |
///\ingroup misc
|
marci@1031
|
6 |
///\file
|
marci@1031
|
7 |
///\brief Dijkstra algorithm.
|
marci@1031
|
8 |
|
marci@1031
|
9 |
// #include <stdio.h>
|
marci@1031
|
10 |
#include <stdlib.h>
|
marci@1097
|
11 |
#include <iostream>
|
marci@1097
|
12 |
#include <map>
|
marci@1104
|
13 |
#include <limits>
|
marci@1031
|
14 |
// #include <stdio>
|
marci@1031
|
15 |
//#include <stdlib>
|
marci@1031
|
16 |
extern "C" {
|
marci@1031
|
17 |
#include "glpk.h"
|
marci@1031
|
18 |
}
|
marci@1031
|
19 |
|
marci@1031
|
20 |
#include <iostream>
|
marci@1031
|
21 |
#include <vector>
|
marci@1031
|
22 |
#include <string>
|
marci@1031
|
23 |
#include <list>
|
marci@1031
|
24 |
#include <memory>
|
marci@1031
|
25 |
#include <utility>
|
marci@1031
|
26 |
|
marci@1031
|
27 |
//#include <sage_graph.h>
|
marci@1031
|
28 |
//#include <lemon/list_graph.h>
|
marci@1031
|
29 |
//#include <lemon/graph_wrapper.h>
|
marci@1031
|
30 |
#include <lemon/invalid.h>
|
marci@1099
|
31 |
#include <expression.h>
|
marci@1031
|
32 |
//#include <bfs_dfs.h>
|
marci@1031
|
33 |
//#include <stp.h>
|
marci@1031
|
34 |
//#include <lemon/max_flow.h>
|
marci@1031
|
35 |
//#include <augmenting_flow.h>
|
marci@1031
|
36 |
//#include <iter_map.h>
|
marci@1031
|
37 |
|
marci@1031
|
38 |
using std::cout;
|
marci@1031
|
39 |
using std::cin;
|
marci@1031
|
40 |
using std::endl;
|
marci@1031
|
41 |
|
marci@1031
|
42 |
namespace lemon {
|
marci@1031
|
43 |
|
marci@1031
|
44 |
/// \addtogroup misc
|
marci@1031
|
45 |
/// @{
|
marci@1031
|
46 |
|
marci@1031
|
47 |
/// \brief A partitioned vector with iterable classes.
|
marci@1031
|
48 |
///
|
marci@1031
|
49 |
/// This class implements a container in which the data is stored in an
|
marci@1031
|
50 |
/// stl vector, the range is partitioned into sets and each set is
|
marci@1031
|
51 |
/// doubly linked in a list.
|
marci@1031
|
52 |
/// That is, each class is iterable by lemon iterators, and any member of
|
marci@1031
|
53 |
/// the vector can bo moved to an other class.
|
marci@1031
|
54 |
template <typename T>
|
marci@1031
|
55 |
class IterablePartition {
|
marci@1031
|
56 |
protected:
|
marci@1031
|
57 |
struct Node {
|
marci@1031
|
58 |
T data;
|
marci@1031
|
59 |
int prev; //invalid az -1
|
marci@1031
|
60 |
int next;
|
marci@1031
|
61 |
};
|
marci@1031
|
62 |
std::vector<Node> nodes;
|
marci@1031
|
63 |
struct Tip {
|
marci@1031
|
64 |
int first;
|
marci@1031
|
65 |
int last;
|
marci@1031
|
66 |
};
|
marci@1031
|
67 |
std::vector<Tip> tips;
|
marci@1031
|
68 |
public:
|
marci@1031
|
69 |
/// The classes are indexed by integers from \c 0 to \c classNum()-1.
|
marci@1031
|
70 |
int classNum() const { return tips.size(); }
|
marci@1031
|
71 |
/// This lemon style iterator iterates through a class.
|
marci@1031
|
72 |
class ClassIt;
|
marci@1031
|
73 |
/// Constructor. The number of classes is to be given which is fixed
|
marci@1031
|
74 |
/// over the life of the container.
|
marci@1031
|
75 |
/// The partition classes are indexed from 0 to class_num-1.
|
marci@1031
|
76 |
IterablePartition(int class_num) {
|
marci@1031
|
77 |
for (int i=0; i<class_num; ++i) {
|
marci@1031
|
78 |
Tip t;
|
marci@1031
|
79 |
t.first=t.last=-1;
|
marci@1031
|
80 |
tips.push_back(t);
|
marci@1031
|
81 |
}
|
marci@1031
|
82 |
}
|
marci@1031
|
83 |
protected:
|
marci@1031
|
84 |
void befuz(ClassIt it, int class_id) {
|
marci@1031
|
85 |
if (tips[class_id].first==-1) {
|
marci@1031
|
86 |
if (tips[class_id].last==-1) {
|
marci@1031
|
87 |
nodes[it.i].prev=nodes[it.i].next=-1;
|
marci@1031
|
88 |
tips[class_id].first=tips[class_id].last=it.i;
|
marci@1031
|
89 |
}
|
marci@1031
|
90 |
} else {
|
marci@1031
|
91 |
nodes[it.i].prev=tips[class_id].last;
|
marci@1031
|
92 |
nodes[it.i].next=-1;
|
marci@1031
|
93 |
nodes[tips[class_id].last].next=it.i;
|
marci@1031
|
94 |
tips[class_id].last=it.i;
|
marci@1031
|
95 |
}
|
marci@1031
|
96 |
}
|
marci@1031
|
97 |
void kifuz(ClassIt it, int class_id) {
|
marci@1031
|
98 |
if (tips[class_id].first==it.i) {
|
marci@1031
|
99 |
if (tips[class_id].last==it.i) {
|
marci@1031
|
100 |
tips[class_id].first=tips[class_id].last=-1;
|
marci@1031
|
101 |
} else {
|
marci@1031
|
102 |
tips[class_id].first=nodes[it.i].next;
|
marci@1031
|
103 |
nodes[nodes[it.i].next].prev=-1;
|
marci@1031
|
104 |
}
|
marci@1031
|
105 |
} else {
|
marci@1031
|
106 |
if (tips[class_id].last==it.i) {
|
marci@1031
|
107 |
tips[class_id].last=nodes[it.i].prev;
|
marci@1031
|
108 |
nodes[nodes[it.i].prev].next=-1;
|
marci@1031
|
109 |
} else {
|
marci@1031
|
110 |
nodes[nodes[it.i].next].prev=nodes[it.i].prev;
|
marci@1031
|
111 |
nodes[nodes[it.i].prev].next=nodes[it.i].next;
|
marci@1031
|
112 |
}
|
marci@1031
|
113 |
}
|
marci@1031
|
114 |
}
|
marci@1031
|
115 |
public:
|
marci@1031
|
116 |
/// A new element with data \c t is pushed into the vector and into class
|
marci@1031
|
117 |
/// \c class_id.
|
marci@1031
|
118 |
ClassIt push_back(const T& t, int class_id) {
|
marci@1031
|
119 |
Node n;
|
marci@1031
|
120 |
n.data=t;
|
marci@1031
|
121 |
nodes.push_back(n);
|
marci@1031
|
122 |
int i=nodes.size()-1;
|
marci@1031
|
123 |
befuz(i, class_id);
|
marci@1031
|
124 |
return i;
|
marci@1031
|
125 |
}
|
marci@1031
|
126 |
/// A member is moved to an other class.
|
marci@1031
|
127 |
void set(ClassIt it, int old_class_id, int new_class_id) {
|
marci@1031
|
128 |
kifuz(it.i, old_class_id);
|
marci@1031
|
129 |
befuz(it.i, new_class_id);
|
marci@1031
|
130 |
}
|
marci@1031
|
131 |
/// Returns the data pointed by \c it.
|
marci@1031
|
132 |
T& operator[](ClassIt it) { return nodes[it.i].data; }
|
marci@1031
|
133 |
/// Returns the data pointed by \c it.
|
marci@1031
|
134 |
const T& operator[](ClassIt it) const { return nodes[it.i].data; }
|
marci@1031
|
135 |
///.
|
marci@1031
|
136 |
class ClassIt {
|
marci@1031
|
137 |
friend class IterablePartition;
|
marci@1031
|
138 |
protected:
|
marci@1031
|
139 |
int i;
|
marci@1031
|
140 |
public:
|
marci@1031
|
141 |
/// Default constructor.
|
marci@1031
|
142 |
ClassIt() { }
|
marci@1031
|
143 |
/// This constructor constructs an iterator which points
|
marci@1031
|
144 |
/// to the member of th container indexed by the integer _i.
|
marci@1031
|
145 |
ClassIt(const int& _i) : i(_i) { }
|
marci@1031
|
146 |
/// Invalid constructor.
|
marci@1031
|
147 |
ClassIt(const Invalid&) : i(-1) { }
|
marci@1099
|
148 |
friend bool operator<(const ClassIt& x, const ClassIt& y);
|
marci@1099
|
149 |
friend std::ostream& operator<<(std::ostream& os,
|
marci@1099
|
150 |
const ClassIt& it);
|
marci@1031
|
151 |
};
|
marci@1099
|
152 |
friend bool operator<(const ClassIt& x, const ClassIt& y) {
|
marci@1099
|
153 |
return (x.i < y.i);
|
marci@1099
|
154 |
}
|
marci@1099
|
155 |
friend std::ostream& operator<<(std::ostream& os,
|
marci@1099
|
156 |
const ClassIt& it) {
|
marci@1099
|
157 |
os << it.i;
|
marci@1099
|
158 |
return os;
|
marci@1099
|
159 |
}
|
marci@1031
|
160 |
/// First member of class \c class_id.
|
marci@1031
|
161 |
ClassIt& first(ClassIt& it, int class_id) const {
|
marci@1031
|
162 |
it.i=tips[class_id].first;
|
marci@1031
|
163 |
return it;
|
marci@1031
|
164 |
}
|
marci@1031
|
165 |
/// Next member.
|
marci@1031
|
166 |
ClassIt& next(ClassIt& it) const {
|
marci@1031
|
167 |
it.i=nodes[it.i].next;
|
marci@1031
|
168 |
return it;
|
marci@1031
|
169 |
}
|
marci@1031
|
170 |
/// True iff the iterator is valid.
|
marci@1031
|
171 |
bool valid(const ClassIt& it) const { return it.i!=-1; }
|
marci@1031
|
172 |
};
|
marci@1031
|
173 |
|
marci@1097
|
174 |
|
marci@1031
|
175 |
/*! \e
|
alpar@1100
|
176 |
|
alpar@1100
|
177 |
\todo A[x,y]-t cserel. Jobboldal, baloldal csere.
|
alpar@1100
|
178 |
\todo LEKERDEZESEK!!!
|
alpar@1100
|
179 |
\todo DOKSI!!!! Doxygen group!!!
|
alpar@1100
|
180 |
|
marci@1031
|
181 |
*/
|
marci@1048
|
182 |
template <typename _Value>
|
marci@1031
|
183 |
class LPSolverBase {
|
marci@1031
|
184 |
public:
|
marci@1031
|
185 |
/// \e
|
marci@1048
|
186 |
typedef _Value Value;
|
marci@1048
|
187 |
/// \e
|
marci@1031
|
188 |
typedef IterablePartition<int>::ClassIt RowIt;
|
marci@1031
|
189 |
/// \e
|
marci@1031
|
190 |
typedef IterablePartition<int>::ClassIt ColIt;
|
marci@1074
|
191 |
public:
|
marci@1031
|
192 |
/// \e
|
marci@1031
|
193 |
IterablePartition<int> row_iter_map;
|
marci@1031
|
194 |
/// \e
|
marci@1031
|
195 |
IterablePartition<int> col_iter_map;
|
marci@1031
|
196 |
/// \e
|
marci@1074
|
197 |
const int VALID_CLASS;
|
marci@1031
|
198 |
/// \e
|
marci@1074
|
199 |
const int INVALID_CLASS;
|
marci@1104
|
200 |
/// \e
|
marci@1104
|
201 |
static const _Value INF;
|
marci@1031
|
202 |
public:
|
marci@1031
|
203 |
/// \e
|
marci@1031
|
204 |
LPSolverBase() : row_iter_map(2),
|
marci@1031
|
205 |
col_iter_map(2),
|
marci@1074
|
206 |
VALID_CLASS(0), INVALID_CLASS(1) { }
|
marci@1031
|
207 |
/// \e
|
marci@1031
|
208 |
virtual ~LPSolverBase() { }
|
marci@1081
|
209 |
|
marci@1081
|
210 |
//MATRIX INDEPEDENT MANIPULATING FUNCTIONS
|
marci@1081
|
211 |
|
marci@1081
|
212 |
public:
|
marci@1031
|
213 |
/// \e
|
marci@1031
|
214 |
virtual void setMinimize() = 0;
|
marci@1031
|
215 |
/// \e
|
marci@1031
|
216 |
virtual void setMaximize() = 0;
|
marci@1081
|
217 |
|
marci@1081
|
218 |
//LOW LEVEL INTERFACE, MATRIX MANIPULATING FUNCTIONS
|
marci@1081
|
219 |
|
marci@1074
|
220 |
protected:
|
marci@1031
|
221 |
/// \e
|
marci@1074
|
222 |
virtual int _addRow() = 0;
|
marci@1031
|
223 |
/// \e
|
marci@1074
|
224 |
virtual int _addCol() = 0;
|
marci@1081
|
225 |
/// \e
|
marci@1081
|
226 |
virtual void _setRowCoeffs(int i,
|
marci@1104
|
227 |
const std::vector<std::pair<int, _Value> >& coeffs) = 0;
|
marci@1081
|
228 |
/// \e
|
marci@1081
|
229 |
virtual void _setColCoeffs(int i,
|
marci@1104
|
230 |
const std::vector<std::pair<int, _Value> >& coeffs) = 0;
|
marci@1081
|
231 |
/// \e
|
marci@1081
|
232 |
virtual void _eraseCol(int i) = 0;
|
marci@1081
|
233 |
/// \e
|
marci@1081
|
234 |
virtual void _eraseRow(int i) = 0;
|
marci@1081
|
235 |
public:
|
marci@1081
|
236 |
/// \e
|
marci@1081
|
237 |
enum Bound { FREE, LOWER, UPPER, DOUBLE, FIXED };
|
marci@1081
|
238 |
protected:
|
marci@1081
|
239 |
/// \e
|
marci@1110
|
240 |
/// The lower bound of a variable (column) have to be given by an
|
marci@1110
|
241 |
/// extended number of type _Value, i.e. a finite number of type
|
marci@1110
|
242 |
/// _Value or -INF.
|
marci@1110
|
243 |
virtual void _setColLowerBound(int i, _Value value) = 0;
|
marci@1110
|
244 |
/// \e
|
marci@1110
|
245 |
/// The upper bound of a variable (column) have to be given by an
|
marci@1110
|
246 |
/// extended number of type _Value, i.e. a finite number of type
|
marci@1110
|
247 |
/// _Value or INF.
|
marci@1110
|
248 |
virtual void _setColUpperBound(int i, _Value value) = 0;
|
marci@1110
|
249 |
/// \e
|
marci@1110
|
250 |
/// The lower bound of a variable (column) is an
|
marci@1110
|
251 |
/// extended number of type _Value, i.e. a finite number of type
|
marci@1110
|
252 |
/// _Value or -INF.
|
marci@1110
|
253 |
virtual _Value _getColLowerBound(int i) = 0;
|
marci@1110
|
254 |
/// \e
|
marci@1110
|
255 |
/// The upper bound of a variable (column) is an
|
marci@1110
|
256 |
/// extended number of type _Value, i.e. a finite number of type
|
marci@1110
|
257 |
/// _Value or INF.
|
marci@1110
|
258 |
virtual _Value _getColUpperBound(int i) = 0;
|
marci@1110
|
259 |
/// \e
|
marci@1081
|
260 |
virtual void _setColBounds(int i, Bound bound,
|
marci@1081
|
261 |
_Value lo, _Value up) = 0;
|
marci@1081
|
262 |
/// \e
|
marci@1081
|
263 |
virtual void _setRowBounds(int i, Bound bound,
|
marci@1081
|
264 |
_Value lo, _Value up) = 0;
|
marci@1081
|
265 |
/// \e
|
marci@1081
|
266 |
virtual void _setObjCoef(int i, _Value obj_coef) = 0;
|
marci@1081
|
267 |
/// \e
|
marci@1081
|
268 |
virtual _Value _getObjCoef(int i) = 0;
|
marci@1081
|
269 |
|
marci@1081
|
270 |
//LOW LEVEL, SOLUTION RETRIEVING FUNCTIONS
|
marci@1081
|
271 |
|
marci@1081
|
272 |
protected:
|
marci@1081
|
273 |
virtual _Value _getPrimal(int i) = 0;
|
marci@1081
|
274 |
|
marci@1081
|
275 |
//HIGH LEVEL INTERFACE, MATRIX MANIPULATING FUNTIONS
|
marci@1081
|
276 |
|
marci@1074
|
277 |
public:
|
marci@1074
|
278 |
/// \e
|
marci@1074
|
279 |
RowIt addRow() {
|
marci@1110
|
280 |
int i=_addRow();
|
marci@1074
|
281 |
RowIt row_it;
|
marci@1074
|
282 |
row_iter_map.first(row_it, INVALID_CLASS);
|
marci@1074
|
283 |
if (row_iter_map.valid(row_it)) { //van hasznalhato hely
|
marci@1074
|
284 |
row_iter_map.set(row_it, INVALID_CLASS, VALID_CLASS);
|
marci@1074
|
285 |
row_iter_map[row_it]=i;
|
marci@1074
|
286 |
} else { //a cucc vegere kell inzertalni mert nincs szabad hely
|
marci@1074
|
287 |
row_it=row_iter_map.push_back(i, VALID_CLASS);
|
marci@1074
|
288 |
}
|
marci@1074
|
289 |
return row_it;
|
marci@1074
|
290 |
}
|
marci@1074
|
291 |
/// \e
|
marci@1074
|
292 |
ColIt addCol() {
|
marci@1074
|
293 |
int i=_addCol();
|
marci@1074
|
294 |
ColIt col_it;
|
marci@1074
|
295 |
col_iter_map.first(col_it, INVALID_CLASS);
|
marci@1074
|
296 |
if (col_iter_map.valid(col_it)) { //van hasznalhato hely
|
marci@1074
|
297 |
col_iter_map.set(col_it, INVALID_CLASS, VALID_CLASS);
|
marci@1074
|
298 |
col_iter_map[col_it]=i;
|
marci@1074
|
299 |
} else { //a cucc vegere kell inzertalni mert nincs szabad hely
|
marci@1074
|
300 |
col_it=col_iter_map.push_back(i, VALID_CLASS);
|
marci@1074
|
301 |
}
|
marci@1074
|
302 |
return col_it;
|
marci@1074
|
303 |
}
|
marci@1074
|
304 |
/// \e
|
marci@1031
|
305 |
template <typename Begin, typename End>
|
marci@1031
|
306 |
void setRowCoeffs(RowIt row_it, Begin begin, End end) {
|
marci@1074
|
307 |
std::vector<std::pair<int, double> > coeffs;
|
marci@1031
|
308 |
for ( ; begin!=end; ++begin) {
|
marci@1074
|
309 |
coeffs.push_back(std::
|
marci@1074
|
310 |
make_pair(col_iter_map[begin->first], begin->second));
|
marci@1031
|
311 |
}
|
marci@1081
|
312 |
_setRowCoeffs(row_iter_map[row_it], coeffs);
|
marci@1031
|
313 |
}
|
marci@1031
|
314 |
/// \e
|
marci@1031
|
315 |
template <typename Begin, typename End>
|
marci@1031
|
316 |
void setColCoeffs(ColIt col_it, Begin begin, End end) {
|
marci@1074
|
317 |
std::vector<std::pair<int, double> > coeffs;
|
marci@1031
|
318 |
for ( ; begin!=end; ++begin) {
|
marci@1074
|
319 |
coeffs.push_back(std::
|
marci@1074
|
320 |
make_pair(row_iter_map[begin->first], begin->second));
|
marci@1031
|
321 |
}
|
marci@1081
|
322 |
_setColCoeffs(col_iter_map[col_it], coeffs);
|
marci@1074
|
323 |
}
|
marci@1074
|
324 |
/// \e
|
marci@1074
|
325 |
void eraseCol(const ColIt& col_it) {
|
marci@1074
|
326 |
col_iter_map.set(col_it, VALID_CLASS, INVALID_CLASS);
|
marci@1074
|
327 |
int cols[2];
|
marci@1074
|
328 |
cols[1]=col_iter_map[col_it];
|
marci@1074
|
329 |
_eraseCol(cols[1]);
|
marci@1074
|
330 |
col_iter_map[col_it]=0; //glpk specifikus, de kell ez??
|
marci@1074
|
331 |
ColIt it;
|
marci@1074
|
332 |
for (col_iter_map.first(it, VALID_CLASS);
|
marci@1074
|
333 |
col_iter_map.valid(it); col_iter_map.next(it)) {
|
marci@1074
|
334 |
if (col_iter_map[it]>cols[1]) --col_iter_map[it];
|
marci@1074
|
335 |
}
|
marci@1031
|
336 |
}
|
marci@1031
|
337 |
/// \e
|
marci@1074
|
338 |
void eraseRow(const RowIt& row_it) {
|
marci@1074
|
339 |
row_iter_map.set(row_it, VALID_CLASS, INVALID_CLASS);
|
marci@1074
|
340 |
int rows[2];
|
marci@1074
|
341 |
rows[1]=row_iter_map[row_it];
|
marci@1074
|
342 |
_eraseRow(rows[1]);
|
marci@1074
|
343 |
row_iter_map[row_it]=0; //glpk specifikus, de kell ez??
|
marci@1074
|
344 |
RowIt it;
|
marci@1074
|
345 |
for (row_iter_map.first(it, VALID_CLASS);
|
marci@1074
|
346 |
row_iter_map.valid(it); row_iter_map.next(it)) {
|
marci@1074
|
347 |
if (row_iter_map[it]>rows[1]) --row_iter_map[it];
|
marci@1074
|
348 |
}
|
marci@1074
|
349 |
}
|
marci@1031
|
350 |
/// \e
|
marci@1110
|
351 |
void setColLowerBound(ColIt col_it, _Value lo) {
|
marci@1110
|
352 |
_setColLowerBound(col_iter_map[col_it], lo);
|
marci@1110
|
353 |
}
|
marci@1110
|
354 |
/// \e
|
marci@1110
|
355 |
void setColUpperBound(ColIt col_it, _Value up) {
|
marci@1110
|
356 |
_setColUpperBound(col_iter_map[col_it], up);
|
marci@1110
|
357 |
}
|
marci@1110
|
358 |
/// \e
|
marci@1110
|
359 |
_Value getColLowerBound(ColIt col_it) {
|
marci@1110
|
360 |
return _getColLowerBound(col_iter_map[col_it]);
|
marci@1110
|
361 |
}
|
marci@1110
|
362 |
/// \e
|
marci@1110
|
363 |
_Value getColUpperBound(ColIt col_it) {
|
marci@1110
|
364 |
return _getColUpperBound(col_iter_map[col_it]);
|
marci@1110
|
365 |
}
|
marci@1110
|
366 |
/// \e
|
marci@1081
|
367 |
void setColBounds(const ColIt& col_it, Bound bound,
|
marci@1081
|
368 |
_Value lo, _Value up) {
|
marci@1081
|
369 |
_setColBounds(col_iter_map[col_it], bound, lo, up);
|
marci@1081
|
370 |
}
|
marci@1031
|
371 |
/// \e
|
marci@1081
|
372 |
void setRowBounds(const RowIt& row_it, Bound bound,
|
marci@1081
|
373 |
_Value lo, _Value up) {
|
marci@1081
|
374 |
_setRowBounds(row_iter_map[row_it], bound, lo, up);
|
marci@1081
|
375 |
}
|
marci@1031
|
376 |
/// \e
|
marci@1081
|
377 |
void setObjCoef(const ColIt& col_it, _Value obj_coef) {
|
marci@1081
|
378 |
_setObjCoef(col_iter_map[col_it], obj_coef);
|
marci@1081
|
379 |
}
|
marci@1031
|
380 |
/// \e
|
marci@1081
|
381 |
_Value getObjCoef(const ColIt& col_it) {
|
marci@1081
|
382 |
return _getObjCoef(col_iter_map[col_it]);
|
marci@1081
|
383 |
}
|
marci@1081
|
384 |
|
marci@1099
|
385 |
//MOST HIGH LEVEL, USER FRIEND FUNCTIONS
|
marci@1099
|
386 |
|
marci@1099
|
387 |
/// \e
|
marci@1099
|
388 |
typedef Expr<ColIt, _Value> Expression;
|
marci@1099
|
389 |
/// \e
|
marci@1099
|
390 |
typedef Expr<RowIt, _Value> DualExpression;
|
marci@1099
|
391 |
/// \e
|
marci@1099
|
392 |
void setRowCoeffs(RowIt row_it, const Expression& expr) {
|
marci@1099
|
393 |
std::vector<std::pair<int, _Value> > row_coeffs;
|
marci@1099
|
394 |
for(typename Expression::Data::const_iterator i=expr.data.begin();
|
marci@1099
|
395 |
i!=expr.data.end(); ++i) {
|
marci@1099
|
396 |
row_coeffs.push_back(std::make_pair
|
marci@1099
|
397 |
(col_iter_map[(*i).first], (*i).second));
|
marci@1099
|
398 |
}
|
marci@1099
|
399 |
_setRowCoeffs(row_iter_map[row_it], row_coeffs);
|
marci@1099
|
400 |
}
|
marci@1099
|
401 |
/// \e
|
marci@1099
|
402 |
void setColCoeffs(ColIt col_it, const DualExpression& expr) {
|
marci@1099
|
403 |
std::vector<std::pair<int, _Value> > col_coeffs;
|
marci@1099
|
404 |
for(typename DualExpression::Data::const_iterator i=expr.data.begin();
|
marci@1099
|
405 |
i!=expr.data.end(); ++i) {
|
marci@1099
|
406 |
col_coeffs.push_back(std::make_pair
|
marci@1099
|
407 |
(row_iter_map[(*i).first], (*i).second));
|
marci@1099
|
408 |
}
|
marci@1099
|
409 |
_setColCoeffs(col_iter_map[col_it], col_coeffs);
|
marci@1099
|
410 |
}
|
marci@1099
|
411 |
/// \e
|
marci@1099
|
412 |
void setObjCoeffs(const Expression& expr) {
|
marci@1099
|
413 |
for(typename Expression::Data::const_iterator i=expr.data.begin();
|
marci@1099
|
414 |
i!=expr.data.end(); ++i) {
|
marci@1099
|
415 |
setObjCoef((*i).first, (*i).second);
|
marci@1099
|
416 |
}
|
marci@1099
|
417 |
}
|
marci@1081
|
418 |
//SOLVER FUNCTIONS
|
marci@1081
|
419 |
|
marci@1031
|
420 |
/// \e
|
marci@1031
|
421 |
virtual void solveSimplex() = 0;
|
marci@1031
|
422 |
/// \e
|
marci@1031
|
423 |
virtual void solvePrimalSimplex() = 0;
|
marci@1031
|
424 |
/// \e
|
marci@1031
|
425 |
virtual void solveDualSimplex() = 0;
|
marci@1031
|
426 |
/// \e
|
marci@1081
|
427 |
|
marci@1081
|
428 |
//HIGH LEVEL, SOLUTION RETRIEVING FUNCTIONS
|
marci@1081
|
429 |
|
marci@1081
|
430 |
public:
|
marci@1081
|
431 |
_Value getPrimal(const ColIt& col_it) {
|
marci@1081
|
432 |
return _getPrimal(col_iter_map[col_it]);
|
marci@1081
|
433 |
}
|
marci@1031
|
434 |
/// \e
|
marci@1048
|
435 |
virtual _Value getObjVal() = 0;
|
marci@1081
|
436 |
|
marci@1081
|
437 |
//OTHER FUNCTIONS
|
marci@1081
|
438 |
|
marci@1031
|
439 |
/// \e
|
marci@1031
|
440 |
virtual int rowNum() const = 0;
|
marci@1031
|
441 |
/// \e
|
marci@1031
|
442 |
virtual int colNum() const = 0;
|
marci@1031
|
443 |
/// \e
|
marci@1031
|
444 |
virtual int warmUp() = 0;
|
marci@1031
|
445 |
/// \e
|
marci@1031
|
446 |
virtual void printWarmUpStatus(int i) = 0;
|
marci@1031
|
447 |
/// \e
|
marci@1031
|
448 |
virtual int getPrimalStatus() = 0;
|
marci@1031
|
449 |
/// \e
|
marci@1031
|
450 |
virtual void printPrimalStatus(int i) = 0;
|
marci@1031
|
451 |
/// \e
|
marci@1031
|
452 |
virtual int getDualStatus() = 0;
|
marci@1031
|
453 |
/// \e
|
marci@1031
|
454 |
virtual void printDualStatus(int i) = 0;
|
marci@1031
|
455 |
/// Returns the status of the slack variable assigned to row \c row_it.
|
marci@1031
|
456 |
virtual int getRowStat(const RowIt& row_it) = 0;
|
marci@1031
|
457 |
/// \e
|
marci@1031
|
458 |
virtual void printRowStatus(int i) = 0;
|
marci@1031
|
459 |
/// Returns the status of the variable assigned to column \c col_it.
|
marci@1031
|
460 |
virtual int getColStat(const ColIt& col_it) = 0;
|
marci@1031
|
461 |
/// \e
|
marci@1031
|
462 |
virtual void printColStatus(int i) = 0;
|
marci@1031
|
463 |
};
|
marci@1031
|
464 |
|
marci@1104
|
465 |
template <typename _Value>
|
marci@1104
|
466 |
const _Value LPSolverBase<_Value>::INF=std::numeric_limits<_Value>::infinity();
|
marci@1104
|
467 |
|
marci@1048
|
468 |
|
marci@1031
|
469 |
/// \brief Wrappers for LP solvers
|
marci@1031
|
470 |
///
|
marci@1031
|
471 |
/// This class implements a lemon wrapper for glpk.
|
marci@1031
|
472 |
/// Later other LP-solvers will be wrapped into lemon.
|
marci@1031
|
473 |
/// The aim of this class is to give a general surface to different
|
marci@1031
|
474 |
/// solvers, i.e. it makes possible to write algorithms using LP's,
|
marci@1031
|
475 |
/// in which the solver can be changed to an other one easily.
|
marci@1081
|
476 |
class LPGLPK : public LPSolverBase<double> {
|
marci@1031
|
477 |
public:
|
marci@1048
|
478 |
typedef LPSolverBase<double> Parent;
|
marci@1031
|
479 |
|
marci@1031
|
480 |
public:
|
marci@1031
|
481 |
/// \e
|
marci@1031
|
482 |
LPX* lp;
|
marci@1031
|
483 |
|
marci@1031
|
484 |
public:
|
marci@1031
|
485 |
/// \e
|
marci@1081
|
486 |
LPGLPK() : Parent(),
|
marci@1031
|
487 |
lp(lpx_create_prob()) {
|
marci@1031
|
488 |
lpx_set_int_parm(lp, LPX_K_DUAL, 1);
|
marci@1031
|
489 |
}
|
marci@1031
|
490 |
/// \e
|
marci@1081
|
491 |
~LPGLPK() {
|
marci@1031
|
492 |
lpx_delete_prob(lp);
|
marci@1031
|
493 |
}
|
marci@1081
|
494 |
|
marci@1081
|
495 |
//MATRIX INDEPEDENT MANIPULATING FUNCTIONS
|
marci@1081
|
496 |
|
marci@1031
|
497 |
/// \e
|
marci@1031
|
498 |
void setMinimize() {
|
marci@1031
|
499 |
lpx_set_obj_dir(lp, LPX_MIN);
|
marci@1031
|
500 |
}
|
marci@1031
|
501 |
/// \e
|
marci@1031
|
502 |
void setMaximize() {
|
marci@1031
|
503 |
lpx_set_obj_dir(lp, LPX_MAX);
|
marci@1031
|
504 |
}
|
marci@1081
|
505 |
|
marci@1081
|
506 |
//LOW LEVEL INTERFACE, MATRIX MANIPULATING FUNCTIONS
|
marci@1081
|
507 |
|
marci@1074
|
508 |
protected:
|
marci@1031
|
509 |
/// \e
|
marci@1074
|
510 |
int _addCol() {
|
marci@1110
|
511 |
int i=lpx_add_cols(lp, 1);
|
marci@1110
|
512 |
_setColLowerBound(i, -INF);
|
marci@1110
|
513 |
_setColUpperBound(i, INF);
|
marci@1110
|
514 |
return i;
|
marci@1031
|
515 |
}
|
marci@1031
|
516 |
/// \e
|
marci@1074
|
517 |
int _addRow() {
|
marci@1110
|
518 |
int i=lpx_add_rows(lp, 1);
|
marci@1110
|
519 |
return i;
|
marci@1074
|
520 |
}
|
marci@1074
|
521 |
/// \e
|
marci@1081
|
522 |
virtual void _setRowCoeffs(int i,
|
marci@1104
|
523 |
const std::vector<std::pair<int, double> >& coeffs) {
|
marci@1074
|
524 |
int mem_length=1+colNum();
|
marci@1074
|
525 |
int* indices = new int[mem_length];
|
marci@1074
|
526 |
double* doubles = new double[mem_length];
|
marci@1074
|
527 |
int length=0;
|
marci@1074
|
528 |
for (std::vector<std::pair<int, double> >::
|
marci@1074
|
529 |
const_iterator it=coeffs.begin(); it!=coeffs.end(); ++it) {
|
marci@1074
|
530 |
++length;
|
marci@1074
|
531 |
indices[length]=it->first;
|
marci@1074
|
532 |
doubles[length]=it->second;
|
marci@1081
|
533 |
// std::cout << " " << indices[length] << " "
|
marci@1081
|
534 |
// << doubles[length] << std::endl;
|
marci@1031
|
535 |
}
|
marci@1081
|
536 |
// std::cout << i << " " << length << std::endl;
|
marci@1074
|
537 |
lpx_set_mat_row(lp, i, length, indices, doubles);
|
marci@1074
|
538 |
delete [] indices;
|
marci@1074
|
539 |
delete [] doubles;
|
marci@1031
|
540 |
}
|
marci@1074
|
541 |
/// \e
|
marci@1081
|
542 |
virtual void _setColCoeffs(int i,
|
marci@1104
|
543 |
const std::vector<std::pair<int, double> >& coeffs) {
|
marci@1074
|
544 |
int mem_length=1+rowNum();
|
marci@1074
|
545 |
int* indices = new int[mem_length];
|
marci@1074
|
546 |
double* doubles = new double[mem_length];
|
marci@1074
|
547 |
int length=0;
|
marci@1074
|
548 |
for (std::vector<std::pair<int, double> >::
|
marci@1074
|
549 |
const_iterator it=coeffs.begin(); it!=coeffs.end(); ++it) {
|
marci@1074
|
550 |
++length;
|
marci@1074
|
551 |
indices[length]=it->first;
|
marci@1074
|
552 |
doubles[length]=it->second;
|
marci@1074
|
553 |
}
|
marci@1074
|
554 |
lpx_set_mat_col(lp, i, length, indices, doubles);
|
marci@1074
|
555 |
delete [] indices;
|
marci@1074
|
556 |
delete [] doubles;
|
marci@1031
|
557 |
}
|
marci@1031
|
558 |
/// \e
|
marci@1074
|
559 |
virtual void _eraseCol(int i) {
|
marci@1031
|
560 |
int cols[2];
|
marci@1074
|
561 |
cols[1]=i;
|
marci@1031
|
562 |
lpx_del_cols(lp, 1, cols);
|
marci@1031
|
563 |
}
|
marci@1074
|
564 |
virtual void _eraseRow(int i) {
|
marci@1031
|
565 |
int rows[2];
|
marci@1074
|
566 |
rows[1]=i;
|
marci@1031
|
567 |
lpx_del_rows(lp, 1, rows);
|
marci@1031
|
568 |
}
|
marci@1110
|
569 |
virtual void _setColLowerBound(int i, double lo) {
|
marci@1110
|
570 |
if (lo==INF) {
|
marci@1110
|
571 |
//FIXME error
|
marci@1110
|
572 |
}
|
marci@1110
|
573 |
int b=lpx_get_col_type(lp, i);
|
marci@1110
|
574 |
double up=lpx_get_col_ub(lp, i);
|
marci@1110
|
575 |
if (lo==-INF) {
|
marci@1110
|
576 |
switch (b) {
|
marci@1110
|
577 |
case LPX_FR:
|
marci@1110
|
578 |
case LPX_LO:
|
marci@1110
|
579 |
lpx_set_col_bnds(lp, i, LPX_FR, lo, up);
|
marci@1110
|
580 |
break;
|
marci@1110
|
581 |
case LPX_UP:
|
marci@1110
|
582 |
break;
|
marci@1110
|
583 |
case LPX_DB:
|
marci@1110
|
584 |
case LPX_FX:
|
marci@1110
|
585 |
lpx_set_col_bnds(lp, i, LPX_UP, lo, up);
|
marci@1110
|
586 |
break;
|
marci@1110
|
587 |
default: ;
|
marci@1110
|
588 |
//FIXME error
|
marci@1110
|
589 |
}
|
marci@1110
|
590 |
} else {
|
marci@1110
|
591 |
switch (b) {
|
marci@1110
|
592 |
case LPX_FR:
|
marci@1110
|
593 |
case LPX_LO:
|
marci@1110
|
594 |
lpx_set_col_bnds(lp, i, LPX_LO, lo, up);
|
marci@1110
|
595 |
break;
|
marci@1110
|
596 |
case LPX_UP:
|
marci@1110
|
597 |
case LPX_DB:
|
marci@1110
|
598 |
case LPX_FX:
|
marci@1110
|
599 |
if (lo==up)
|
marci@1110
|
600 |
lpx_set_col_bnds(lp, i, LPX_FX, lo, up);
|
marci@1110
|
601 |
else
|
marci@1110
|
602 |
lpx_set_col_bnds(lp, i, LPX_DB, lo, up);
|
marci@1110
|
603 |
break;
|
marci@1110
|
604 |
default: ;
|
marci@1110
|
605 |
//FIXME error
|
marci@1110
|
606 |
}
|
marci@1110
|
607 |
}
|
marci@1110
|
608 |
}
|
marci@1110
|
609 |
virtual void _setColUpperBound(int i, double up) {
|
marci@1110
|
610 |
if (up==-INF) {
|
marci@1110
|
611 |
//FIXME error
|
marci@1110
|
612 |
}
|
marci@1110
|
613 |
int b=lpx_get_col_type(lp, i);
|
marci@1110
|
614 |
double lo=lpx_get_col_lb(lp, i);
|
marci@1110
|
615 |
if (up==INF) {
|
marci@1110
|
616 |
switch (b) {
|
marci@1110
|
617 |
case LPX_FR:
|
marci@1110
|
618 |
case LPX_LO:
|
marci@1110
|
619 |
break;
|
marci@1110
|
620 |
case LPX_UP:
|
marci@1110
|
621 |
lpx_set_col_bnds(lp, i, LPX_FR, lo, up);
|
marci@1110
|
622 |
break;
|
marci@1110
|
623 |
case LPX_DB:
|
marci@1110
|
624 |
case LPX_FX:
|
marci@1110
|
625 |
lpx_set_col_bnds(lp, i, LPX_LO, lo, up);
|
marci@1110
|
626 |
break;
|
marci@1110
|
627 |
default: ;
|
marci@1110
|
628 |
//FIXME error
|
marci@1110
|
629 |
}
|
marci@1110
|
630 |
} else {
|
marci@1110
|
631 |
switch (b) {
|
marci@1110
|
632 |
case LPX_FR:
|
marci@1110
|
633 |
lpx_set_col_bnds(lp, i, LPX_UP, lo, up);
|
marci@1110
|
634 |
case LPX_LO:
|
marci@1110
|
635 |
if (lo==up)
|
marci@1110
|
636 |
lpx_set_col_bnds(lp, i, LPX_FX, lo, up);
|
marci@1110
|
637 |
else
|
marci@1110
|
638 |
lpx_set_col_bnds(lp, i, LPX_DB, lo, up);
|
marci@1110
|
639 |
break;
|
marci@1110
|
640 |
case LPX_UP:
|
marci@1110
|
641 |
lpx_set_col_bnds(lp, i, LPX_UP, lo, up);
|
marci@1110
|
642 |
break;
|
marci@1110
|
643 |
case LPX_DB:
|
marci@1110
|
644 |
case LPX_FX:
|
marci@1110
|
645 |
if (lo==up)
|
marci@1110
|
646 |
lpx_set_col_bnds(lp, i, LPX_FX, lo, up);
|
marci@1110
|
647 |
else
|
marci@1110
|
648 |
lpx_set_col_bnds(lp, i, LPX_DB, lo, up);
|
marci@1110
|
649 |
break;
|
marci@1110
|
650 |
default: ;
|
marci@1110
|
651 |
//FIXME error
|
marci@1110
|
652 |
}
|
marci@1110
|
653 |
}
|
marci@1110
|
654 |
}
|
marci@1110
|
655 |
virtual double _getColLowerBound(int i) {
|
marci@1110
|
656 |
int b=lpx_get_col_type(lp, i);
|
marci@1110
|
657 |
switch (b) {
|
marci@1110
|
658 |
case LPX_FR:
|
marci@1110
|
659 |
return -INF;
|
marci@1110
|
660 |
case LPX_LO:
|
marci@1110
|
661 |
return lpx_get_col_lb(lp, i);
|
marci@1110
|
662 |
case LPX_UP:
|
marci@1110
|
663 |
return -INF;
|
marci@1110
|
664 |
case LPX_DB:
|
marci@1110
|
665 |
case LPX_FX:
|
marci@1110
|
666 |
return lpx_get_col_lb(lp, i);
|
marci@1110
|
667 |
default: ;
|
marci@1110
|
668 |
//FIXME error
|
marci@1110
|
669 |
return 0.0;
|
marci@1110
|
670 |
}
|
marci@1110
|
671 |
}
|
marci@1110
|
672 |
virtual double _getColUpperBound(int i) {
|
marci@1110
|
673 |
int b=lpx_get_col_type(lp, i);
|
marci@1110
|
674 |
switch (b) {
|
marci@1110
|
675 |
case LPX_FR:
|
marci@1110
|
676 |
case LPX_LO:
|
marci@1110
|
677 |
return INF;
|
marci@1110
|
678 |
case LPX_UP:
|
marci@1110
|
679 |
case LPX_DB:
|
marci@1110
|
680 |
case LPX_FX:
|
marci@1110
|
681 |
return lpx_get_col_ub(lp, i);
|
marci@1110
|
682 |
default: ;
|
marci@1110
|
683 |
//FIXME error
|
marci@1110
|
684 |
return 0.0;
|
marci@1110
|
685 |
}
|
marci@1110
|
686 |
}
|
marci@1081
|
687 |
virtual void _setColBounds(int i, Bound bound,
|
marci@1081
|
688 |
double lo, double up) {
|
marci@1081
|
689 |
switch (bound) {
|
marci@1081
|
690 |
case FREE:
|
marci@1081
|
691 |
lpx_set_col_bnds(lp, i, LPX_FR, lo, up);
|
marci@1081
|
692 |
break;
|
marci@1081
|
693 |
case LOWER:
|
marci@1081
|
694 |
lpx_set_col_bnds(lp, i, LPX_LO, lo, up);
|
marci@1081
|
695 |
break;
|
marci@1081
|
696 |
case UPPER:
|
marci@1081
|
697 |
lpx_set_col_bnds(lp, i, LPX_UP, lo, up);
|
marci@1081
|
698 |
break;
|
marci@1081
|
699 |
case DOUBLE:
|
marci@1081
|
700 |
lpx_set_col_bnds(lp, i, LPX_DB, lo, up);
|
marci@1081
|
701 |
break;
|
marci@1081
|
702 |
case FIXED:
|
marci@1081
|
703 |
lpx_set_col_bnds(lp, i, LPX_FX, lo, up);
|
marci@1081
|
704 |
break;
|
marci@1081
|
705 |
}
|
marci@1081
|
706 |
}
|
marci@1081
|
707 |
virtual void _setRowBounds(int i, Bound bound,
|
marci@1081
|
708 |
double lo, double up) {
|
marci@1081
|
709 |
switch (bound) {
|
marci@1081
|
710 |
case FREE:
|
marci@1081
|
711 |
lpx_set_row_bnds(lp, i, LPX_FR, lo, up);
|
marci@1081
|
712 |
break;
|
marci@1081
|
713 |
case LOWER:
|
marci@1081
|
714 |
lpx_set_row_bnds(lp, i, LPX_LO, lo, up);
|
marci@1081
|
715 |
break;
|
marci@1081
|
716 |
case UPPER:
|
marci@1081
|
717 |
lpx_set_row_bnds(lp, i, LPX_UP, lo, up);
|
marci@1081
|
718 |
break;
|
marci@1081
|
719 |
case DOUBLE:
|
marci@1081
|
720 |
lpx_set_row_bnds(lp, i, LPX_DB, lo, up);
|
marci@1081
|
721 |
break;
|
marci@1081
|
722 |
case FIXED:
|
marci@1081
|
723 |
lpx_set_row_bnds(lp, i, LPX_FX, lo, up);
|
marci@1081
|
724 |
break;
|
marci@1081
|
725 |
}
|
marci@1081
|
726 |
}
|
marci@1081
|
727 |
protected:
|
marci@1031
|
728 |
/// \e
|
marci@1081
|
729 |
virtual double _getObjCoef(int i) {
|
marci@1081
|
730 |
return lpx_get_obj_coef(lp, i);
|
marci@1031
|
731 |
}
|
marci@1031
|
732 |
/// \e
|
marci@1081
|
733 |
virtual void _setObjCoef(int i, double obj_coef) {
|
marci@1081
|
734 |
lpx_set_obj_coef(lp, i, obj_coef);
|
marci@1031
|
735 |
}
|
marci@1081
|
736 |
public:
|
marci@1031
|
737 |
/// \e
|
marci@1031
|
738 |
void solveSimplex() { lpx_simplex(lp); }
|
marci@1031
|
739 |
/// \e
|
marci@1031
|
740 |
void solvePrimalSimplex() { lpx_simplex(lp); }
|
marci@1031
|
741 |
/// \e
|
marci@1031
|
742 |
void solveDualSimplex() { lpx_simplex(lp); }
|
marci@1031
|
743 |
/// \e
|
marci@1081
|
744 |
protected:
|
marci@1081
|
745 |
virtual double _getPrimal(int i) {
|
marci@1081
|
746 |
return lpx_get_col_prim(lp, i);
|
marci@1031
|
747 |
}
|
marci@1081
|
748 |
public:
|
marci@1031
|
749 |
/// \e
|
marci@1031
|
750 |
double getObjVal() { return lpx_get_obj_val(lp); }
|
marci@1031
|
751 |
/// \e
|
marci@1031
|
752 |
int rowNum() const { return lpx_get_num_rows(lp); }
|
marci@1031
|
753 |
/// \e
|
marci@1031
|
754 |
int colNum() const { return lpx_get_num_cols(lp); }
|
marci@1031
|
755 |
/// \e
|
marci@1031
|
756 |
int warmUp() { return lpx_warm_up(lp); }
|
marci@1031
|
757 |
/// \e
|
marci@1031
|
758 |
void printWarmUpStatus(int i) {
|
marci@1031
|
759 |
switch (i) {
|
marci@1031
|
760 |
case LPX_E_OK: cout << "LPX_E_OK" << endl; break;
|
marci@1031
|
761 |
case LPX_E_EMPTY: cout << "LPX_E_EMPTY" << endl; break;
|
marci@1031
|
762 |
case LPX_E_BADB: cout << "LPX_E_BADB" << endl; break;
|
marci@1031
|
763 |
case LPX_E_SING: cout << "LPX_E_SING" << endl; break;
|
marci@1031
|
764 |
}
|
marci@1031
|
765 |
}
|
marci@1031
|
766 |
/// \e
|
marci@1031
|
767 |
int getPrimalStatus() { return lpx_get_prim_stat(lp); }
|
marci@1031
|
768 |
/// \e
|
marci@1031
|
769 |
void printPrimalStatus(int i) {
|
marci@1031
|
770 |
switch (i) {
|
marci@1031
|
771 |
case LPX_P_UNDEF: cout << "LPX_P_UNDEF" << endl; break;
|
marci@1031
|
772 |
case LPX_P_FEAS: cout << "LPX_P_FEAS" << endl; break;
|
marci@1031
|
773 |
case LPX_P_INFEAS: cout << "LPX_P_INFEAS" << endl; break;
|
marci@1031
|
774 |
case LPX_P_NOFEAS: cout << "LPX_P_NOFEAS" << endl; break;
|
marci@1031
|
775 |
}
|
marci@1031
|
776 |
}
|
marci@1031
|
777 |
/// \e
|
marci@1031
|
778 |
int getDualStatus() { return lpx_get_dual_stat(lp); }
|
marci@1031
|
779 |
/// \e
|
marci@1031
|
780 |
void printDualStatus(int i) {
|
marci@1031
|
781 |
switch (i) {
|
marci@1031
|
782 |
case LPX_D_UNDEF: cout << "LPX_D_UNDEF" << endl; break;
|
marci@1031
|
783 |
case LPX_D_FEAS: cout << "LPX_D_FEAS" << endl; break;
|
marci@1031
|
784 |
case LPX_D_INFEAS: cout << "LPX_D_INFEAS" << endl; break;
|
marci@1031
|
785 |
case LPX_D_NOFEAS: cout << "LPX_D_NOFEAS" << endl; break;
|
marci@1031
|
786 |
}
|
marci@1031
|
787 |
}
|
marci@1031
|
788 |
/// Returns the status of the slack variable assigned to row \c row_it.
|
marci@1031
|
789 |
int getRowStat(const RowIt& row_it) {
|
marci@1031
|
790 |
return lpx_get_row_stat(lp, row_iter_map[row_it]);
|
marci@1031
|
791 |
}
|
marci@1031
|
792 |
/// \e
|
marci@1031
|
793 |
void printRowStatus(int i) {
|
marci@1031
|
794 |
switch (i) {
|
marci@1031
|
795 |
case LPX_BS: cout << "LPX_BS" << endl; break;
|
marci@1031
|
796 |
case LPX_NL: cout << "LPX_NL" << endl; break;
|
marci@1031
|
797 |
case LPX_NU: cout << "LPX_NU" << endl; break;
|
marci@1031
|
798 |
case LPX_NF: cout << "LPX_NF" << endl; break;
|
marci@1031
|
799 |
case LPX_NS: cout << "LPX_NS" << endl; break;
|
marci@1031
|
800 |
}
|
marci@1031
|
801 |
}
|
marci@1031
|
802 |
/// Returns the status of the variable assigned to column \c col_it.
|
marci@1031
|
803 |
int getColStat(const ColIt& col_it) {
|
marci@1031
|
804 |
return lpx_get_col_stat(lp, col_iter_map[col_it]);
|
marci@1031
|
805 |
}
|
marci@1031
|
806 |
/// \e
|
marci@1031
|
807 |
void printColStatus(int i) {
|
marci@1031
|
808 |
switch (i) {
|
marci@1031
|
809 |
case LPX_BS: cout << "LPX_BS" << endl; break;
|
marci@1031
|
810 |
case LPX_NL: cout << "LPX_NL" << endl; break;
|
marci@1031
|
811 |
case LPX_NU: cout << "LPX_NU" << endl; break;
|
marci@1031
|
812 |
case LPX_NF: cout << "LPX_NF" << endl; break;
|
marci@1031
|
813 |
case LPX_NS: cout << "LPX_NS" << endl; break;
|
marci@1031
|
814 |
}
|
marci@1031
|
815 |
}
|
marci@1031
|
816 |
};
|
marci@1031
|
817 |
|
marci@1031
|
818 |
/// @}
|
marci@1031
|
819 |
|
marci@1031
|
820 |
} //namespace lemon
|
marci@1031
|
821 |
|
marci@1031
|
822 |
#endif //LEMON_LP_SOLVER_WRAPPER_H
|