/* -*- mode: C++; indent-tabs-mode: nil; -*-
* This file is a part of LEMON, a generic C++ optimization library.
* Copyright (C) 2003-2008
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
* Permission to use, modify and distribute this software is granted
* provided that this copyright notice appears in all copies. For
* precise terms see the accompanying LICENSE file.
* This software is provided "AS IS" with no warranty of any kind,
* express or implied, and with no claim as to its suitability for any
#ifndef LEMON_LP_SKELETON
#define LEMON_LP_SKELETON
#include <lemon/lp_base.h>
///\brief A skeleton file to implement LP solver interfaces
///A skeleton class to implement LP solver interfaces
class SkeletonSolverBase : public virtual LpBase {
: col_num(-1), row_num(-1) {}
virtual void _eraseCol(int i);
virtual void _eraseRow(int i);
virtual void _getColName(int col, std::string& name) const;
virtual void _setColName(int col, const std::string& name);
virtual int _colByName(const std::string& name) const;
virtual void _getRowName(int row, std::string& name) const;
virtual void _setRowName(int row, const std::string& name);
virtual int _rowByName(const std::string& name) const;
virtual void _setRowCoeffs(int i, ExprIterator b, ExprIterator e);
virtual void _getRowCoeffs(int i, InsertIterator b) const;
virtual void _setColCoeffs(int i, ExprIterator b, ExprIterator e);
virtual void _getColCoeffs(int i, InsertIterator b) const;
/// Set one element of the coefficient matrix
virtual void _setCoeff(int row, int col, Value value);
/// Get one element of the coefficient matrix
virtual Value _getCoeff(int row, int col) const;
/// The lower bound of a variable (column) have to be given by an
/// extended number of type Value, i.e. a finite number of type
virtual void _setColLowerBound(int i, Value value);
/// The lower bound of a variable (column) is an
/// extended number of type Value, i.e. a finite number of type
virtual Value _getColLowerBound(int i) const;
/// The upper bound of a variable (column) have to be given by an
/// extended number of type Value, i.e. a finite number of type
virtual void _setColUpperBound(int i, Value value);
/// The upper bound of a variable (column) is an
/// extended number of type Value, i.e. a finite number of type
virtual Value _getColUpperBound(int i) const;
/// The lower bound of a constraint (row) have to be given by an
/// extended number of type Value, i.e. a finite number of type
virtual void _setRowLowerBound(int i, Value value);
/// The lower bound of a constraint (row) is an
/// extended number of type Value, i.e. a finite number of type
virtual Value _getRowLowerBound(int i) const;
/// The upper bound of a constraint (row) have to be given by an
/// extended number of type Value, i.e. a finite number of type
virtual void _setRowUpperBound(int i, Value value);
/// The upper bound of a constraint (row) is an
/// extended number of type Value, i.e. a finite number of type
virtual Value _getRowUpperBound(int i) const;
virtual void _setObjCoeffs(ExprIterator b, ExprIterator e);
virtual void _getObjCoeffs(InsertIterator b) const;
virtual void _setObjCoeff(int i, Value obj_coef);
virtual Value _getObjCoeff(int i) const;
virtual void _setSense(Sense);
virtual Sense _getSense() const;
/// \brief Interface for a skeleton LP solver
/// This class implements an interface for a skeleton LP solver.
class LpSkeleton : public SkeletonSolverBase, public LpSolver {
LpSkeleton() : SkeletonSolverBase(), LpSolver() {}
virtual SolveExitStatus _solve();
virtual Value _getPrimal(int i) const;
virtual Value _getDual(int i) const;
virtual Value _getPrimalValue() const;
virtual Value _getPrimalRay(int i) const;
virtual Value _getDualRay(int i) const;
virtual ProblemType _getPrimalType() const;
virtual ProblemType _getDualType() const;
virtual VarStatus _getColStatus(int i) const;
virtual VarStatus _getRowStatus(int i) const;
virtual LpSkeleton* _newSolver() const;
virtual LpSkeleton* _cloneSolver() const;
virtual const char* _solverName() const;
/// \brief Interface for a skeleton MIP solver
/// This class implements an interface for a skeleton MIP solver.
class MipSkeleton : public SkeletonSolverBase, public MipSolver {
MipSkeleton() : SkeletonSolverBase(), MipSolver() {}
virtual SolveExitStatus _solve();
virtual Value _getSol(int i) const;
virtual Value _getSolValue() const;
virtual ProblemType _getType() const;
virtual MipSkeleton* _newSolver() const;
virtual MipSkeleton* _cloneSolver() const;
virtual const char* _solverName() const;
#endif // LEMON_LP_SKELETON