deba@458
|
1 |
/* -*- mode: C++; indent-tabs-mode: nil; -*-
|
deba@458
|
2 |
*
|
deba@458
|
3 |
* This file is a part of LEMON, a generic C++ optimization library.
|
deba@458
|
4 |
*
|
deba@458
|
5 |
* Copyright (C) 2003-2008
|
deba@458
|
6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
|
deba@458
|
7 |
* (Egervary Research Group on Combinatorial Optimization, EGRES).
|
deba@458
|
8 |
*
|
deba@458
|
9 |
* Permission to use, modify and distribute this software is granted
|
deba@458
|
10 |
* provided that this copyright notice appears in all copies. For
|
deba@458
|
11 |
* precise terms see the accompanying LICENSE file.
|
deba@458
|
12 |
*
|
deba@458
|
13 |
* This software is provided "AS IS" with no warranty of any kind,
|
deba@458
|
14 |
* express or implied, and with no claim as to its suitability for any
|
deba@458
|
15 |
* purpose.
|
deba@458
|
16 |
*
|
deba@458
|
17 |
*/
|
deba@458
|
18 |
|
deba@458
|
19 |
#ifndef LEMON_LP_SKELETON
|
deba@458
|
20 |
#define LEMON_LP_SKELETON
|
deba@458
|
21 |
|
deba@458
|
22 |
#include <lemon/lp_base.h>
|
deba@458
|
23 |
|
deba@458
|
24 |
///\file
|
deba@458
|
25 |
///\brief A skeleton file to implement LP solver interfaces
|
deba@458
|
26 |
namespace lemon {
|
deba@458
|
27 |
|
deba@458
|
28 |
///A skeleton class to implement LP solver interfaces
|
deba@458
|
29 |
class LpSkeleton :public LpSolverBase {
|
deba@458
|
30 |
int col_num,row_num;
|
deba@458
|
31 |
|
deba@458
|
32 |
protected:
|
deba@458
|
33 |
|
deba@458
|
34 |
///\e
|
deba@458
|
35 |
virtual LpSolverBase* _newLp();
|
deba@458
|
36 |
///\e
|
deba@458
|
37 |
virtual LpSolverBase* _copyLp();
|
deba@458
|
38 |
/// \e
|
deba@458
|
39 |
virtual int _addCol();
|
deba@458
|
40 |
/// \e
|
deba@458
|
41 |
virtual int _addRow();
|
deba@458
|
42 |
/// \e
|
deba@458
|
43 |
virtual void _eraseCol(int i);
|
deba@458
|
44 |
/// \e
|
deba@458
|
45 |
virtual void _eraseRow(int i);
|
deba@458
|
46 |
/// \e
|
deba@458
|
47 |
virtual void _getColName(int col, std::string & name) const;
|
deba@458
|
48 |
/// \e
|
deba@458
|
49 |
virtual void _setColName(int col, const std::string & name);
|
deba@458
|
50 |
/// \e
|
deba@458
|
51 |
virtual int _colByName(const std::string& name) const;
|
deba@458
|
52 |
|
deba@458
|
53 |
/// \e
|
deba@458
|
54 |
virtual void _setRowCoeffs(int i, ConstRowIterator b, ConstRowIterator e);
|
deba@458
|
55 |
/// \e
|
deba@458
|
56 |
virtual void _getRowCoeffs(int i, RowIterator b) const;
|
deba@458
|
57 |
/// \e
|
deba@458
|
58 |
virtual void _setColCoeffs(int i, ConstColIterator b, ConstColIterator e);
|
deba@458
|
59 |
/// \e
|
deba@458
|
60 |
virtual void _getColCoeffs(int i, ColIterator b) const;
|
deba@458
|
61 |
|
deba@458
|
62 |
/// Set one element of the coefficient matrix
|
deba@458
|
63 |
virtual void _setCoeff(int row, int col, Value value);
|
deba@458
|
64 |
|
deba@458
|
65 |
/// Get one element of the coefficient matrix
|
deba@458
|
66 |
virtual Value _getCoeff(int row, int col) const;
|
deba@458
|
67 |
|
deba@458
|
68 |
/// The lower bound of a variable (column) have to be given by an
|
deba@458
|
69 |
/// extended number of type Value, i.e. a finite number of type
|
deba@458
|
70 |
/// Value or -\ref INF.
|
deba@458
|
71 |
virtual void _setColLowerBound(int i, Value value);
|
deba@458
|
72 |
/// \e
|
deba@458
|
73 |
|
deba@458
|
74 |
/// The lower bound of a variable (column) is an
|
deba@458
|
75 |
/// extended number of type Value, i.e. a finite number of type
|
deba@458
|
76 |
/// Value or -\ref INF.
|
deba@458
|
77 |
virtual Value _getColLowerBound(int i) const;
|
deba@458
|
78 |
|
deba@458
|
79 |
/// The upper bound of a variable (column) have to be given by an
|
deba@458
|
80 |
/// extended number of type Value, i.e. a finite number of type
|
deba@458
|
81 |
/// Value or \ref INF.
|
deba@458
|
82 |
virtual void _setColUpperBound(int i, Value value);
|
deba@458
|
83 |
/// \e
|
deba@458
|
84 |
|
deba@458
|
85 |
/// The upper bound of a variable (column) is an
|
deba@458
|
86 |
/// extended number of type Value, i.e. a finite number of type
|
deba@458
|
87 |
/// Value or \ref INF.
|
deba@458
|
88 |
virtual Value _getColUpperBound(int i) const;
|
deba@458
|
89 |
|
deba@458
|
90 |
// /// The lower bound of a linear expression (row) have to be given by an
|
deba@458
|
91 |
// /// extended number of type Value, i.e. a finite number of type
|
deba@458
|
92 |
// /// Value or -\ref INF.
|
deba@458
|
93 |
// virtual void _setRowLowerBound(int i, Value value);
|
deba@458
|
94 |
// /// \e
|
deba@458
|
95 |
|
deba@458
|
96 |
// /// The upper bound of a linear expression (row) have to be given by an
|
deba@458
|
97 |
// /// extended number of type Value, i.e. a finite number of type
|
deba@458
|
98 |
// /// Value or \ref INF.
|
deba@458
|
99 |
// virtual void _setRowUpperBound(int i, Value value);
|
deba@458
|
100 |
|
deba@458
|
101 |
/// The lower and upper bound of a linear expression (row) have to be
|
deba@458
|
102 |
/// given by an
|
deba@458
|
103 |
/// extended number of type Value, i.e. a finite number of type
|
deba@458
|
104 |
/// Value or +/-\ref INF.
|
deba@458
|
105 |
virtual void _setRowBounds(int i, Value lb, Value ub);
|
deba@458
|
106 |
/// \e
|
deba@458
|
107 |
|
deba@458
|
108 |
|
deba@458
|
109 |
/// The lower and the upper bound of
|
deba@458
|
110 |
/// a constraint (row) are
|
deba@458
|
111 |
/// extended numbers of type Value, i.e. finite numbers of type
|
deba@458
|
112 |
/// Value, -\ref INF or \ref INF.
|
deba@458
|
113 |
virtual void _getRowBounds(int i, Value &lb, Value &ub) const;
|
deba@458
|
114 |
/// \e
|
deba@458
|
115 |
|
deba@458
|
116 |
|
deba@458
|
117 |
/// \e
|
deba@458
|
118 |
virtual void _clearObj();
|
deba@458
|
119 |
/// \e
|
deba@458
|
120 |
virtual void _setObjCoeff(int i, Value obj_coef);
|
deba@458
|
121 |
|
deba@458
|
122 |
/// \e
|
deba@458
|
123 |
virtual Value _getObjCoeff(int i) const;
|
deba@458
|
124 |
|
deba@458
|
125 |
///\e
|
deba@458
|
126 |
|
deba@458
|
127 |
///\bug Wrong interface
|
deba@458
|
128 |
///
|
deba@458
|
129 |
virtual SolveExitStatus _solve();
|
deba@458
|
130 |
|
deba@458
|
131 |
///\e
|
deba@458
|
132 |
|
deba@458
|
133 |
///\bug Wrong interface
|
deba@458
|
134 |
///
|
deba@458
|
135 |
virtual Value _getPrimal(int i) const;
|
deba@458
|
136 |
|
deba@458
|
137 |
///\e
|
deba@458
|
138 |
|
deba@458
|
139 |
///\bug Wrong interface
|
deba@458
|
140 |
///
|
deba@458
|
141 |
virtual Value _getDual(int i) const;
|
deba@458
|
142 |
|
deba@458
|
143 |
///\e
|
deba@458
|
144 |
|
deba@458
|
145 |
///\bug Wrong interface
|
deba@458
|
146 |
///
|
deba@458
|
147 |
virtual Value _getPrimalValue() const;
|
deba@458
|
148 |
|
deba@458
|
149 |
///\e
|
deba@458
|
150 |
|
deba@458
|
151 |
///\bug Wrong interface
|
deba@458
|
152 |
///
|
deba@458
|
153 |
virtual SolutionStatus _getPrimalStatus() const;
|
deba@458
|
154 |
|
deba@458
|
155 |
////e
|
deba@458
|
156 |
virtual SolutionStatus _getDualStatus() const;
|
deba@458
|
157 |
|
deba@458
|
158 |
|
deba@458
|
159 |
///\e
|
deba@458
|
160 |
virtual ProblemTypes _getProblemType() const;
|
deba@458
|
161 |
|
deba@458
|
162 |
///\e
|
deba@458
|
163 |
virtual void _setMax();
|
deba@458
|
164 |
///\e
|
deba@458
|
165 |
virtual void _setMin();
|
deba@458
|
166 |
|
deba@458
|
167 |
///\e
|
deba@458
|
168 |
virtual bool _isMax() const;
|
deba@458
|
169 |
|
deba@458
|
170 |
|
deba@458
|
171 |
|
deba@458
|
172 |
///\e
|
deba@458
|
173 |
virtual bool _isBasicCol(int i) const;
|
deba@458
|
174 |
|
deba@458
|
175 |
|
deba@458
|
176 |
|
deba@458
|
177 |
public:
|
deba@458
|
178 |
LpSkeleton() : LpSolverBase(), col_num(0), row_num(0) {}
|
deba@458
|
179 |
};
|
deba@458
|
180 |
|
deba@458
|
181 |
} //namespace lemon
|
deba@458
|
182 |
|
deba@458
|
183 |
#endif // LEMON_LP_SKELETON
|