3 * This file is a part of LEMON, a generic C++ optimization library
5 * Copyright (C) 2003-2006
6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7 * (Egervary Research Group on Combinatorial Optimization, EGRES).
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.
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
19 #ifndef LEMON_LP_SKELETON
20 #define LEMON_LP_SKELETON
22 #include <lemon/lp_base.h>
25 ///\brief A skeleton file to implement LP solver interfaces
28 ///A skeleton class to implement LP solver interfaces
29 class LpSkeleton :public LpSolverBase {
34 virtual LpSolverBase &_newLp();
36 virtual LpSolverBase &_copyLp();
38 virtual int _addCol();
40 virtual int _addRow();
42 virtual void _eraseCol(int i);
44 virtual void _eraseRow(int i);
46 virtual void _getColName(int col, std::string & name);
48 virtual void _setColName(int col, const std::string & name);
51 virtual void _setRowCoeffs(int i, LpRowIterator b, LpRowIterator e);
53 virtual void _setColCoeffs(int i, LpColIterator b, LpColIterator e);
55 /// Set one element of the coefficient matrix
56 virtual void _setCoeff(int row, int col, Value value);
58 /// Get one element of the coefficient matrix
59 virtual Value _getCoeff(int row, int col);
61 /// The lower bound of a variable (column) have to be given by an
62 /// extended number of type Value, i.e. a finite number of type
63 /// Value or -\ref INF.
64 virtual void _setColLowerBound(int i, Value value);
67 /// The lower bound of a variable (column) is an
68 /// extended number of type Value, i.e. a finite number of type
69 /// Value or -\ref INF.
70 virtual Value _getColLowerBound(int i);
72 /// The upper bound of a variable (column) have to be given by an
73 /// extended number of type Value, i.e. a finite number of type
74 /// Value or \ref INF.
75 virtual void _setColUpperBound(int i, Value value);
78 /// The upper bound of a variable (column) is an
79 /// extended number of type Value, i.e. a finite number of type
80 /// Value or \ref INF.
81 virtual Value _getColUpperBound(int i);
83 // /// The lower bound of a linear expression (row) have to be given by an
84 // /// extended number of type Value, i.e. a finite number of type
85 // /// Value or -\ref INF.
86 // virtual void _setRowLowerBound(int i, Value value);
89 // /// The upper bound of a linear expression (row) have to be given by an
90 // /// extended number of type Value, i.e. a finite number of type
91 // /// Value or \ref INF.
92 // virtual void _setRowUpperBound(int i, Value value);
94 /// The lower and upper bound of a linear expression (row) have to be
96 /// extended number of type Value, i.e. a finite number of type
97 /// Value or +/-\ref INF.
98 virtual void _setRowBounds(int i, Value lb, Value ub);
102 /// The lower and the upper bound of
103 /// a constraint (row) are
104 /// extended numbers of type Value, i.e. finite numbers of type
105 /// Value, -\ref INF or \ref INF.
106 virtual void _getRowBounds(int i, Value &lb, Value &ub);
111 virtual void _clearObj();
113 virtual void _setObjCoeff(int i, Value obj_coef);
116 virtual Value _getObjCoeff(int i);
120 ///\bug Wrong interface
122 virtual SolveExitStatus _solve();
126 ///\bug Wrong interface
128 virtual Value _getPrimal(int i);
132 ///\bug Wrong interface
134 virtual Value _getDual(int i);
138 ///\bug Wrong interface
140 virtual Value _getPrimalValue();
144 ///\bug Wrong interface
146 virtual SolutionStatus _getPrimalStatus();
149 virtual SolutionStatus _getDualStatus();
153 virtual ProblemTypes _getProblemType();
156 virtual void _setMax();
158 virtual void _setMin();
161 virtual bool _isMax();
166 virtual bool _isBasicCol(int i);
171 LpSkeleton() : LpSolverBase(), col_num(0), row_num(0) {}
176 #endif // LEMON_LP_SKELETON