deba@481: /* -*- mode: C++; indent-tabs-mode: nil; -*-
deba@481:  *
deba@481:  * This file is a part of LEMON, a generic C++ optimization library.
deba@481:  *
deba@481:  * Copyright (C) 2003-2008
deba@481:  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
deba@481:  * (Egervary Research Group on Combinatorial Optimization, EGRES).
deba@481:  *
deba@481:  * Permission to use, modify and distribute this software is granted
deba@481:  * provided that this copyright notice appears in all copies. For
deba@481:  * precise terms see the accompanying LICENSE file.
deba@481:  *
deba@481:  * This software is provided "AS IS" with no warranty of any kind,
deba@481:  * express or implied, and with no claim as to its suitability for any
deba@481:  * purpose.
deba@481:  *
deba@481:  */
deba@481: 
deba@481: #ifndef LEMON_LP_SKELETON
deba@481: #define LEMON_LP_SKELETON
deba@481: 
deba@481: #include <lemon/lp_base.h>
deba@481: 
deba@481: ///\file
deba@481: ///\brief A skeleton file to implement LP solver interfaces
deba@481: namespace lemon {
deba@481: 
deba@481:   ///A skeleton class to implement LP solver interfaces
deba@481:   class LpSkeleton :public LpSolverBase {
deba@481:     int col_num,row_num;
deba@481: 
deba@481:   protected:
deba@481: 
deba@481:     ///\e
deba@481:     virtual LpSolverBase* _newLp();
deba@481:     ///\e
deba@481:     virtual LpSolverBase* _copyLp();
deba@481:     /// \e
deba@481:     virtual int _addCol();
deba@481:     /// \e
deba@481:     virtual int _addRow();
deba@481:     /// \e
deba@481:     virtual void _eraseCol(int i);
deba@481:     /// \e
deba@481:     virtual void _eraseRow(int i);
deba@481:     /// \e
deba@481:     virtual void _getColName(int col, std::string & name) const;
deba@481:     /// \e
deba@481:     virtual void _setColName(int col, const std::string & name);
deba@481:     /// \e
deba@481:     virtual int _colByName(const std::string& name) const;
deba@481: 
deba@481:     /// \e
deba@481:     virtual void _setRowCoeffs(int i, ConstRowIterator b, ConstRowIterator e);
deba@481:     /// \e
deba@481:     virtual void _getRowCoeffs(int i, RowIterator b) const;
deba@481:     /// \e
deba@481:     virtual void _setColCoeffs(int i, ConstColIterator b, ConstColIterator e);
deba@481:     /// \e
deba@481:     virtual void _getColCoeffs(int i, ColIterator b) const;
deba@481: 
deba@481:     /// Set one element of the coefficient matrix
deba@481:     virtual void _setCoeff(int row, int col, Value value);
deba@481: 
deba@481:     /// Get one element of the coefficient matrix
deba@481:     virtual Value _getCoeff(int row, int col) const;
deba@481: 
deba@481:     /// The lower bound of a variable (column) have to be given by an
deba@481:     /// extended number of type Value, i.e. a finite number of type
deba@481:     /// Value or -\ref INF.
deba@481:     virtual void _setColLowerBound(int i, Value value);
deba@481:     /// \e
deba@481: 
deba@481:     /// The lower bound of a variable (column) is an
deba@481:     /// extended number of type Value, i.e. a finite number of type
deba@481:     /// Value or -\ref INF.
deba@481:     virtual Value _getColLowerBound(int i) const;
deba@481: 
deba@481:     /// The upper bound of a variable (column) have to be given by an
deba@481:     /// extended number of type Value, i.e. a finite number of type
deba@481:     /// Value or \ref INF.
deba@481:     virtual void _setColUpperBound(int i, Value value);
deba@481:     /// \e
deba@481: 
deba@481:     /// The upper bound of a variable (column) is an
deba@481:     /// extended number of type Value, i.e. a finite number of type
deba@481:     /// Value or \ref INF.
deba@481:     virtual Value _getColUpperBound(int i) const;
deba@481: 
deba@481: //     /// The lower bound of a linear expression (row) have to be given by an
deba@481: //     /// extended number of type Value, i.e. a finite number of type
deba@481: //     /// Value or -\ref INF.
deba@481: //     virtual void _setRowLowerBound(int i, Value value);
deba@481: //     /// \e
deba@481: 
deba@481: //     /// The upper bound of a linear expression (row) have to be given by an
deba@481: //     /// extended number of type Value, i.e. a finite number of type
deba@481: //     /// Value or \ref INF.
deba@481: //     virtual void _setRowUpperBound(int i, Value value);
deba@481: 
deba@481:     /// The lower and upper bound of a linear expression (row) have to be
deba@481:     /// given by an
deba@481:     /// extended number of type Value, i.e. a finite number of type
deba@481:     /// Value or +/-\ref INF.
deba@481:     virtual void _setRowBounds(int i, Value lb, Value ub);
deba@481:     /// \e
deba@481: 
deba@481: 
deba@481:     /// The lower and the upper bound of
deba@481:     /// a constraint (row) are
deba@481:     /// extended numbers of type Value, i.e.  finite numbers of type
deba@481:     /// Value, -\ref INF or \ref INF.
deba@481:     virtual void _getRowBounds(int i, Value &lb, Value &ub) const;
deba@481:     /// \e
deba@481: 
deba@481: 
deba@481:     /// \e
deba@481:     virtual void _clearObj();
deba@481:     /// \e
deba@481:     virtual void _setObjCoeff(int i, Value obj_coef);
deba@481: 
deba@481:     /// \e
deba@481:     virtual Value _getObjCoeff(int i) const;
deba@481: 
deba@481:     ///\e
deba@481: 
deba@481:     ///\bug Wrong interface
deba@481:     ///
deba@481:     virtual SolveExitStatus _solve();
deba@481: 
deba@481:     ///\e
deba@481: 
deba@481:     ///\bug Wrong interface
deba@481:     ///
deba@481:     virtual Value _getPrimal(int i) const;
deba@481: 
deba@481:     ///\e
deba@481: 
deba@481:     ///\bug Wrong interface
deba@481:     ///
deba@481:     virtual Value _getDual(int i) const;
deba@481: 
deba@481:     ///\e
deba@481: 
deba@481:     ///\bug Wrong interface
deba@481:     ///
deba@481:     virtual Value _getPrimalValue() const;
deba@481: 
deba@481:     ///\e
deba@481: 
deba@481:     ///\bug Wrong interface
deba@481:     ///
deba@481:     virtual SolutionStatus _getPrimalStatus() const;
deba@481: 
deba@481:     ////e
deba@481:     virtual SolutionStatus _getDualStatus() const;
deba@481: 
deba@481: 
deba@481:     ///\e
deba@481:     virtual ProblemTypes _getProblemType() const;
deba@481: 
deba@481:     ///\e
deba@481:     virtual void _setMax();
deba@481:     ///\e
deba@481:     virtual void _setMin();
deba@481: 
deba@481:     ///\e
deba@481:     virtual bool _isMax() const;
deba@481: 
deba@481: 
deba@481: 
deba@481:     ///\e
deba@481:     virtual bool _isBasicCol(int i) const;
deba@481: 
deba@481: 
deba@481: 
deba@481:   public:
deba@481:     LpSkeleton() : LpSolverBase(), col_num(0), row_num(0) {}
deba@481:   };
deba@481: 
deba@481: } //namespace lemon
deba@481: 
deba@481: #endif // LEMON_LP_SKELETON