deba@458: /* -*- mode: C++; indent-tabs-mode: nil; -*-
deba@458:  *
deba@458:  * This file is a part of LEMON, a generic C++ optimization library.
deba@458:  *
deba@458:  * Copyright (C) 2003-2008
deba@458:  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
deba@458:  * (Egervary Research Group on Combinatorial Optimization, EGRES).
deba@458:  *
deba@458:  * Permission to use, modify and distribute this software is granted
deba@458:  * provided that this copyright notice appears in all copies. For
deba@458:  * precise terms see the accompanying LICENSE file.
deba@458:  *
deba@458:  * This software is provided "AS IS" with no warranty of any kind,
deba@458:  * express or implied, and with no claim as to its suitability for any
deba@458:  * purpose.
deba@458:  *
deba@458:  */
deba@458: 
deba@458: #ifndef LEMON_LP_GLPK_H
deba@458: #define LEMON_LP_GLPK_H
deba@458: 
deba@458: ///\file
deba@458: ///\brief Header of the LEMON-GLPK lp solver interface.
deba@458: ///\ingroup lp_group
deba@458: 
deba@458: #include <lemon/lp_base.h>
deba@458: 
deba@458: // forward declaration
deba@458: #ifndef _GLP_PROB
deba@458: #define _GLP_PROB
deba@458: typedef struct { double _prob; } glp_prob;
deba@458: /* LP/MIP problem object */
deba@458: #endif
deba@458: 
deba@458: namespace lemon {
deba@458: 
deba@458: 
deba@458:   /// \brief Interface for the GLPK LP solver
deba@458:   ///
deba@458:   /// This class implements an interface for the GLPK LP solver.
deba@458:   ///\ingroup lp_group
deba@458:   class LpGlpk : virtual public LpSolverBase {
deba@458:   protected:
deba@458: 
deba@458:     typedef glp_prob LPX;
deba@458:     glp_prob* lp;
deba@458:     bool solved;
deba@458: 
deba@458:   public:
deba@458: 
deba@458:     typedef LpSolverBase Parent;
deba@458: 
deba@458:     LpGlpk();
deba@458:     LpGlpk(const LpGlpk &);
deba@458:     ~LpGlpk();
deba@458: 
deba@458:   protected:
deba@458:     virtual LpSolverBase* _newLp();
deba@458:     virtual LpSolverBase* _copyLp();
deba@458: 
deba@458:     virtual int _addCol();
deba@458:     virtual int _addRow();
deba@458:     virtual void _eraseCol(int i);
deba@458:     virtual void _eraseRow(int i);
deba@458:     virtual void _getColName(int col, std::string & name) const;
deba@458:     virtual void _setColName(int col, const std::string & name);
deba@458:     virtual int _colByName(const std::string& name) const;
deba@458:     virtual void _setRowCoeffs(int i, ConstRowIterator b, ConstRowIterator e);
deba@458:     virtual void _getRowCoeffs(int i, RowIterator b) const;
deba@458:     virtual void _setColCoeffs(int i, ConstColIterator b, ConstColIterator e);
deba@458:     virtual void _getColCoeffs(int i, ColIterator b) const;
deba@458:     virtual void _setCoeff(int row, int col, Value value);
deba@458:     virtual Value _getCoeff(int row, int col) const;
deba@458: 
deba@458:     virtual void _setColLowerBound(int i, Value value);
deba@458:     virtual Value _getColLowerBound(int i) const;
deba@458:     virtual void _setColUpperBound(int i, Value value);
deba@458:     virtual Value _getColUpperBound(int i) const;
deba@458: 
deba@458:     virtual void _setRowBounds(int i, Value lower, Value upper);
deba@458:     virtual void _getRowBounds(int i, Value &lb, Value &ub) const;
deba@458:     virtual void _setObjCoeff(int i, Value obj_coef);
deba@458:     virtual Value _getObjCoeff(int i) const;
deba@458:     virtual void _clearObj();
deba@458: 
deba@458:     ///\e
deba@458: 
deba@458:     ///\todo It should be clarified
deba@458:     ///
deba@458:     virtual SolveExitStatus _solve();
deba@458:     virtual Value _getPrimal(int i) const;
deba@458:     virtual Value _getDual(int i) const;
deba@458:     virtual Value _getPrimalValue() const;
deba@458:     virtual bool _isBasicCol(int i) const;
deba@458:     ///\e
deba@458: 
deba@458:     ///\todo It should be clarified
deba@458:     ///
deba@458:     virtual SolutionStatus _getPrimalStatus() const;
deba@458:     virtual SolutionStatus _getDualStatus() const;
deba@458:     virtual ProblemTypes _getProblemType() const;
deba@458: 
deba@458:     virtual void _setMax();
deba@458:     virtual void _setMin();
deba@458: 
deba@458:     virtual bool _isMax() const;
deba@458: 
deba@458:   public:
deba@458:     ///Set the verbosity of the messages
deba@458: 
deba@458:     ///Set the verbosity of the messages
deba@458:     ///
deba@458:     ///\param m is the level of the messages output by the solver routines.
deba@458:     ///The possible values are:
deba@458:     ///- 0 --- no output (default value)
deba@458:     ///- 1 --- error messages only
deba@458:     ///- 2 --- normal output
deba@458:     ///- 3 --- full output (includes informational messages)
deba@458:     void messageLevel(int m);
deba@458:     ///Turns on or off the presolver
deba@458: 
deba@458:     ///Turns on (\c b is \c true) or off (\c b is \c false) the presolver
deba@458:     ///
deba@458:     ///The presolver is off by default.
deba@458:     void presolver(bool b);
deba@458: 
deba@458:     ///Pointer to the underlying GLPK data structure.
deba@458:     LPX *lpx() {return lp;}
deba@458: 
deba@458:     ///Returns the constraint identifier understood by GLPK.
deba@458:     int lpxRow(Row r) { return _lpId(r); }
deba@458: 
deba@458:     ///Returns the variable identifier understood by GLPK.
deba@458:     int lpxCol(Col c) { return _lpId(c); }
deba@458:   };
deba@458: } //END OF NAMESPACE LEMON
deba@458: 
deba@458: #endif //LEMON_LP_GLPK_H
deba@458: