|
1 /* -*- mode: C++; indent-tabs-mode: nil; -*- |
|
2 * |
|
3 * This file is a part of LEMON, a generic C++ optimization library. |
|
4 * |
|
5 * Copyright (C) 2003-2008 |
|
6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
|
7 * (Egervary Research Group on Combinatorial Optimization, EGRES). |
|
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_CPLEX_H |
|
20 #define LEMON_LP_CPLEX_H |
|
21 |
|
22 ///\file |
|
23 ///\brief Header of the LEMON-CPLEX lp solver interface. |
|
24 |
|
25 #include <lemon/lp_base.h> |
|
26 |
|
27 struct cpxenv; |
|
28 struct cpxlp; |
|
29 |
|
30 namespace lemon { |
|
31 |
|
32 |
|
33 /// \brief Interface for the CPLEX solver |
|
34 /// |
|
35 /// This class implements an interface for the CPLEX LP solver. |
|
36 class LpCplex :virtual public LpSolverBase { |
|
37 |
|
38 public: |
|
39 |
|
40 typedef LpSolverBase Parent; |
|
41 |
|
42 /// \e |
|
43 int status; |
|
44 cpxenv* env; |
|
45 cpxlp* lp; |
|
46 |
|
47 |
|
48 /// \e |
|
49 LpCplex(); |
|
50 /// \e |
|
51 LpCplex(const LpCplex&); |
|
52 /// \e |
|
53 ~LpCplex(); |
|
54 |
|
55 protected: |
|
56 virtual LpSolverBase* _newLp(); |
|
57 virtual LpSolverBase* _copyLp(); |
|
58 |
|
59 |
|
60 virtual int _addCol(); |
|
61 virtual int _addRow(); |
|
62 virtual void _eraseCol(int i); |
|
63 virtual void _eraseRow(int i); |
|
64 virtual void _getColName(int col, std::string & name) const; |
|
65 virtual void _setColName(int col, const std::string & name); |
|
66 virtual int _colByName(const std::string& name) const; |
|
67 virtual void _setRowCoeffs(int i, ConstRowIterator b, ConstRowIterator e); |
|
68 virtual void _getRowCoeffs(int i, RowIterator b) const; |
|
69 virtual void _setColCoeffs(int i, ConstColIterator b, ConstColIterator e); |
|
70 virtual void _getColCoeffs(int i, ColIterator b) const; |
|
71 virtual void _setCoeff(int row, int col, Value value); |
|
72 virtual Value _getCoeff(int row, int col) const; |
|
73 |
|
74 virtual void _setColLowerBound(int i, Value value); |
|
75 virtual Value _getColLowerBound(int i) const; |
|
76 virtual void _setColUpperBound(int i, Value value); |
|
77 virtual Value _getColUpperBound(int i) const; |
|
78 |
|
79 // virtual void _setRowLowerBound(int i, Value value); |
|
80 // virtual void _setRowUpperBound(int i, Value value); |
|
81 virtual void _setRowBounds(int i, Value lower, Value upper); |
|
82 virtual void _getRowBounds(int i, Value &lb, Value &ub) const; |
|
83 virtual void _setObjCoeff(int i, Value obj_coef); |
|
84 virtual Value _getObjCoeff(int i) const; |
|
85 virtual void _clearObj(); |
|
86 |
|
87 |
|
88 virtual SolveExitStatus _solve(); |
|
89 virtual Value _getPrimal(int i) const; |
|
90 virtual Value _getDual(int i) const; |
|
91 virtual Value _getPrimalValue() const; |
|
92 virtual bool _isBasicCol(int i) const; |
|
93 |
|
94 virtual SolutionStatus _getPrimalStatus() const; |
|
95 virtual SolutionStatus _getDualStatus() const; |
|
96 virtual ProblemTypes _getProblemType() const; |
|
97 |
|
98 |
|
99 virtual void _setMax(); |
|
100 virtual void _setMin(); |
|
101 |
|
102 virtual bool _isMax() const; |
|
103 |
|
104 public: |
|
105 |
|
106 cpxenv* cplexEnv() { return env; } |
|
107 cpxlp* cplexLp() { return lp; } |
|
108 |
|
109 }; |
|
110 } //END OF NAMESPACE LEMON |
|
111 |
|
112 #endif //LEMON_LP_CPLEX_H |
|
113 |