[1261] | 1 | /* -*- C++ -*- |
---|
| 2 | * |
---|
[1956] | 3 | * This file is a part of LEMON, a generic C++ optimization library |
---|
| 4 | * |
---|
[2553] | 5 | * Copyright (C) 2003-2008 |
---|
[1956] | 6 | * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
---|
[1359] | 7 | * (Egervary Research Group on Combinatorial Optimization, EGRES). |
---|
[1261] | 8 | * |
---|
| 9 | * Permission to use, modify and distribute this software is granted |
---|
| 10 | * provided that this copyright notice appears in all copies. For |
---|
| 11 | * precise terms see the accompanying LICENSE file. |
---|
| 12 | * |
---|
| 13 | * This software is provided "AS IS" with no warranty of any kind, |
---|
| 14 | * express or implied, and with no claim as to its suitability for any |
---|
| 15 | * purpose. |
---|
| 16 | * |
---|
| 17 | */ |
---|
| 18 | |
---|
| 19 | #ifndef LEMON_LP_GLPK_H |
---|
| 20 | #define LEMON_LP_GLPK_H |
---|
| 21 | |
---|
| 22 | ///\file |
---|
| 23 | ///\brief Header of the LEMON-GLPK lp solver interface. |
---|
[2370] | 24 | ///\ingroup lp_group |
---|
[1261] | 25 | |
---|
[1356] | 26 | #include <lemon/lp_base.h> |
---|
[1261] | 27 | extern "C" { |
---|
[1326] | 28 | #include <glpk.h> |
---|
[1261] | 29 | } |
---|
| 30 | |
---|
| 31 | namespace lemon { |
---|
| 32 | |
---|
| 33 | |
---|
[1398] | 34 | /// \brief Interface for the GLPK LP solver |
---|
[1261] | 35 | /// |
---|
[1398] | 36 | /// This class implements an interface for the GLPK LP solver. |
---|
[2370] | 37 | ///\ingroup lp_group |
---|
[2144] | 38 | class LpGlpk : virtual public LpSolverBase { |
---|
[1321] | 39 | protected: |
---|
| 40 | LPX* lp; |
---|
[2441] | 41 | bool solved; |
---|
[1321] | 42 | |
---|
[1261] | 43 | public: |
---|
[1321] | 44 | |
---|
[1261] | 45 | typedef LpSolverBase Parent; |
---|
| 46 | |
---|
[1321] | 47 | LpGlpk(); |
---|
[2321] | 48 | LpGlpk(const LpGlpk &); |
---|
[1321] | 49 | ~LpGlpk(); |
---|
| 50 | |
---|
[1261] | 51 | protected: |
---|
[1364] | 52 | virtual LpSolverBase &_newLp(); |
---|
| 53 | virtual LpSolverBase &_copyLp(); |
---|
| 54 | |
---|
[1261] | 55 | virtual int _addCol(); |
---|
| 56 | virtual int _addRow(); |
---|
[1432] | 57 | virtual void _eraseCol(int i); |
---|
| 58 | virtual void _eraseRow(int i); |
---|
[2366] | 59 | virtual void _getColName(int col, std::string & name) const; |
---|
[1895] | 60 | virtual void _setColName(int col, const std::string & name); |
---|
[2366] | 61 | virtual int _colByName(const std::string& name) const; |
---|
[2364] | 62 | virtual void _setRowCoeffs(int i, ConstRowIterator b, ConstRowIterator e); |
---|
[2366] | 63 | virtual void _getRowCoeffs(int i, RowIterator b) const; |
---|
[2364] | 64 | virtual void _setColCoeffs(int i, ConstColIterator b, ConstColIterator e); |
---|
[2366] | 65 | virtual void _getColCoeffs(int i, ColIterator b) const; |
---|
[1431] | 66 | virtual void _setCoeff(int row, int col, Value value); |
---|
[2366] | 67 | virtual Value _getCoeff(int row, int col) const; |
---|
[2324] | 68 | |
---|
[1261] | 69 | virtual void _setColLowerBound(int i, Value value); |
---|
[2366] | 70 | virtual Value _getColLowerBound(int i) const; |
---|
[1261] | 71 | virtual void _setColUpperBound(int i, Value value); |
---|
[2366] | 72 | virtual Value _getColUpperBound(int i) const; |
---|
[2328] | 73 | |
---|
[1379] | 74 | virtual void _setRowBounds(int i, Value lower, Value upper); |
---|
[2366] | 75 | virtual void _getRowBounds(int i, Value &lb, Value &ub) const; |
---|
[1261] | 76 | virtual void _setObjCoeff(int i, Value obj_coef); |
---|
[2366] | 77 | virtual Value _getObjCoeff(int i) const; |
---|
[1377] | 78 | virtual void _clearObj(); |
---|
[1376] | 79 | |
---|
[1263] | 80 | ///\e |
---|
| 81 | |
---|
[1321] | 82 | ///\todo It should be clarified |
---|
[1263] | 83 | /// |
---|
[1303] | 84 | virtual SolveExitStatus _solve(); |
---|
[2366] | 85 | virtual Value _getPrimal(int i) const; |
---|
| 86 | virtual Value _getDual(int i) const; |
---|
| 87 | virtual Value _getPrimalValue() const; |
---|
| 88 | virtual bool _isBasicCol(int i) const; |
---|
[1312] | 89 | ///\e |
---|
| 90 | |
---|
[1321] | 91 | ///\todo It should be clarified |
---|
[1312] | 92 | /// |
---|
[2366] | 93 | virtual SolutionStatus _getPrimalStatus() const; |
---|
| 94 | virtual SolutionStatus _getDualStatus() const; |
---|
| 95 | virtual ProblemTypes _getProblemType() const; |
---|
[1460] | 96 | |
---|
[1321] | 97 | virtual void _setMax(); |
---|
| 98 | virtual void _setMin(); |
---|
[1261] | 99 | |
---|
[2366] | 100 | virtual bool _isMax() const; |
---|
[2324] | 101 | |
---|
[1321] | 102 | public: |
---|
| 103 | ///Set the verbosity of the messages |
---|
| 104 | |
---|
[1326] | 105 | ///Set the verbosity of the messages |
---|
| 106 | /// |
---|
[1321] | 107 | ///\param m is the level of the messages output by the solver routines. |
---|
| 108 | ///The possible values are: |
---|
| 109 | ///- 0 --- no output (default value) |
---|
| 110 | ///- 1 --- error messages only |
---|
| 111 | ///- 2 --- normal output |
---|
| 112 | ///- 3 --- full output (includes informational messages) |
---|
| 113 | void messageLevel(int m); |
---|
[1326] | 114 | ///Turns on or off the presolver |
---|
| 115 | |
---|
| 116 | ///Turns on (\c b is \c true) or off (\c b is \c false) the presolver |
---|
| 117 | /// |
---|
| 118 | ///The presolver is off by default. |
---|
| 119 | void presolver(bool b); |
---|
[2321] | 120 | |
---|
[2557] | 121 | ///Pointer to the underlying GLPK data structure. |
---|
[2321] | 122 | LPX *lpx() {return lp;} |
---|
[1261] | 123 | }; |
---|
| 124 | } //END OF NAMESPACE LEMON |
---|
| 125 | |
---|
| 126 | #endif //LEMON_LP_GLPK_H |
---|
| 127 | |
---|