OpenMS  2.4.0
LPWrapper.h
Go to the documentation of this file.
1 // --------------------------------------------------------------------------
2 // OpenMS -- Open-Source Mass Spectrometry
3 // --------------------------------------------------------------------------
4 // Copyright The OpenMS Team -- Eberhard Karls University Tuebingen,
5 // ETH Zurich, and Freie Universitaet Berlin 2002-2018.
6 //
7 // This software is released under a three-clause BSD license:
8 // * Redistributions of source code must retain the above copyright
9 // notice, this list of conditions and the following disclaimer.
10 // * Redistributions in binary form must reproduce the above copyright
11 // notice, this list of conditions and the following disclaimer in the
12 // documentation and/or other materials provided with the distribution.
13 // * Neither the name of any author or any participating institution
14 // may be used to endorse or promote products derived from this software
15 // without specific prior written permission.
16 // For a full list of authors, refer to the file AUTHORS.
17 // --------------------------------------------------------------------------
18 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
19 // AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21 // ARE DISCLAIMED. IN NO EVENT SHALL ANY OF THE AUTHORS OR THE CONTRIBUTING
22 // INSTITUTIONS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
23 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
24 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
25 // OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
26 // WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
27 // OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
28 // ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29 //
30 // --------------------------------------------------------------------------
31 // $Maintainer: Timo Sachsenberg $
32 // $Authors: Alexandra Zerck $
33 // --------------------------------------------------------------------------
34 
35 #pragma once
36 
37 #include <OpenMS/DATASTRUCTURES/String.h> // for String
38 
39 #include <OpenMS/CONCEPT/Types.h>
40 #include <OpenMS/OpenMSConfig.h>
41 #include <OpenMS/config.h>
42 
43 #include <limits>
44 
45 // do NOT include glpk and CoinOr headers here, as they define bad stuff, which ripples through OpenMS then...
46 // include them in LPWrapper.cpp where they do not harm
47 // only declare them here
48 class CoinModel;
49 
50 #ifndef GLP_PROB_DEFINED
51 #define GLP_PROB_DEFINED
52 // depending on the glpk version
53 // define glp_prob as forward or struct
54 #if OPENMS_GLPK_VERSION_MINOR < 48
55 typedef struct
56 {
57  double _opaque_prob[100];
58 } glp_prob;
59 #else
60 class glp_prob;
61 #endif
62 #endif
63 
64 namespace OpenMS
65 {
66 
67  class OPENMS_DLLAPI LPWrapper
68  {
69 public:
73  struct SolverParam
74  {
76  message_level(3), branching_tech(4), backtrack_tech(3),
77  preprocessing_tech(2), enable_feas_pump_heuristic(true), enable_gmi_cuts(true),
78  enable_mir_cuts(true), enable_cov_cuts(true), enable_clq_cuts(true), mip_gap(0.0),
79  time_limit((std::numeric_limits<Int>::max)()), output_freq(5000), output_delay(10000), enable_presolve(true),
80  enable_binarization(true)
81  {
82  }
83 
93  double mip_gap;
98  bool enable_binarization; // only with presolve
99  };
100 
101  enum Type
102  {
103  UNBOUNDED = 1,
107  FIXED
108  };
109 
111  {
112  CONTINUOUS = 1,
114  BINARY
115  };
116 
117  enum Sense
118  {
119  MIN = 1,
120  MAX
121  };
122 
124  {
125  FORMAT_LP = 0,
127  FORMAT_GLPK
128  };
129 
130  enum SOLVER
131  {
132  SOLVER_GLPK = 0
133 #if COINOR_SOLVER == 1
134  , SOLVER_COINOR
135 #endif
136  };
137 
139  {
140  UNDEFINED = 1,
141  OPTIMAL = 5,
142  FEASIBLE = 2,
143  NO_FEASIBLE_SOL = 4
144  };
145 
146  LPWrapper();
147  virtual ~LPWrapper();
148 
149  // problem creation/manipulation
151  Int addRow(std::vector<Int> row_indices, std::vector<double> row_values, const String& name);
153  Int addColumn();
155  Int addColumn(std::vector<Int> column_indices, std::vector<double> column_values, const String& name);
156 
169  Int addRow(std::vector<Int>& row_indices, std::vector<double>& row_values, const String& name, double lower_bound, double upper_bound, Type type);
170 
181  Int addColumn(std::vector<Int>& column_indices, std::vector<double>& column_values, const String& name, double lower_bound, double upper_bound, Type type);
182 
184  void deleteRow(Int index);
186  void setColumnName(Int index, const String& name);
188  String getColumnName(Int index);
190  String getRowName(Int index);
192  Int getRowIndex(const String& name);
194  Int getColumnIndex(const String& name);
196  double getColumnUpperBound(Int index);
198  double getColumnLowerBound(Int index);
200  double getRowUpperBound(Int index);
202  double getRowLowerBound(Int index);
204  void setRowName(Int index, const String& name);
205 
214  void setColumnBounds(Int index, double lower_bound, double upper_bound, Type type);
215 
224  void setRowBounds(Int index, double lower_bound, double upper_bound, Type type);
225 
232  void setColumnType(Int index, VariableType type);
233 
240  VariableType getColumnType(Int index);
241 
243  void setObjective(Int index, double obj_value);
245  double getObjective(Int index);
246 
252  void setObjectiveSense(Sense sense);
253  Sense getObjectiveSense();
254 
256  Int getNumberOfColumns();
258  Int getNumberOfRows();
259 
260  void setElement(Int row_index, Int column_index, double value);
261  double getElement(Int row_index, Int column_index);
262 
263  // problem reading/writing
270  void readProblem(String filename, String format);
271 
278  void writeProblem(const String& filename, const WriteFormat format) const;
279 
290  Int solve(SolverParam& solver_param, const Size verbose_level = 0);
291 
297  SolverStatus getStatus();
298 
299  // solution access
300  double getObjectiveValue();
301  double getColumnValue(Int index);
302 
303  Int getNumberOfNonZeroEntriesInRow(Int idx);
304  void getMatrixRow(Int idx, std::vector<Int>& indexes);
305 
308  void setSolver(const SOLVER s);
309 
311  SOLVER getSolver() const;
312 
313 protected:
314 #if COINOR_SOLVER == 1
315  CoinModel * model_;
316  std::vector<double> solution_;
317 #endif
318 
320 
322 
323 
324  }; // class
325 
326 } // namespace
327 
bool enable_gmi_cuts
Definition: LPWrapper.h:89
WriteFormat
Definition: LPWrapper.h:123
Int output_freq
Definition: LPWrapper.h:95
A more convenient string class.
Definition: String.h:57
SOLVER
Definition: LPWrapper.h:130
Definition: LPWrapper.h:106
double mip_gap
Definition: LPWrapper.h:93
Definition: LPWrapper.h:105
Definition: LPWrapper.h:126
bool enable_clq_cuts
Definition: LPWrapper.h:92
STL namespace.
Main OpenMS namespace.
Definition: FeatureDeconvolution.h:46
Struct that holds the parameters of the LP solver.
Definition: LPWrapper.h:73
Definition: LPWrapper.h:67
Sense
Definition: LPWrapper.h:117
bool enable_cov_cuts
Definition: LPWrapper.h:91
Int time_limit
Definition: LPWrapper.h:94
Int message_level
Definition: LPWrapper.h:84
Int branching_tech
Definition: LPWrapper.h:85
SolverParam()
Definition: LPWrapper.h:75
bool enable_presolve
Definition: LPWrapper.h:97
Definition: LPWrapper.h:113
SOLVER solver_
Definition: LPWrapper.h:321
Int backtrack_tech
Definition: LPWrapper.h:86
Type
Definition: LPWrapper.h:101
size_t Size
Size type e.g. used as variable which can hold result of size()
Definition: Types.h:127
SolverStatus
Definition: LPWrapper.h:138
Definition: LPWrapper.h:104
Int preprocessing_tech
Definition: LPWrapper.h:87
glp_prob * lp_problem_
Definition: LPWrapper.h:319
VariableType
Definition: LPWrapper.h:110
int Int
Signed integer type.
Definition: Types.h:102
bool enable_mir_cuts
Definition: LPWrapper.h:90
bool enable_feas_pump_heuristic
Definition: LPWrapper.h:88
Int output_delay
Definition: LPWrapper.h:96
bool enable_binarization
Definition: LPWrapper.h:98
Definition: LPWrapper.h:55