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: #include <lemon/lp_skeleton.h>
deba@481: 
deba@481: ///\file
deba@481: ///\brief A skeleton file to implement LP solver interfaces
deba@481: namespace lemon {
deba@481: 
deba@482:   int SkeletonSolverBase::_addCol()
deba@481:   {
deba@481:     return ++col_num;
deba@481:   }
deba@481: 
deba@482:   int SkeletonSolverBase::_addRow()
deba@481:   {
deba@481:     return ++row_num;
deba@481:   }
deba@481: 
deba@482:   void SkeletonSolverBase::_eraseCol(int) {}
deba@482:   void SkeletonSolverBase::_eraseRow(int) {}
deba@482: 
deba@482:   void SkeletonSolverBase::_getColName(int, std::string &) const {}
deba@482:   void SkeletonSolverBase::_setColName(int, const std::string &) {}
deba@482:   int SkeletonSolverBase::_colByName(const std::string&) const { return -1; }
deba@482: 
deba@482:   void SkeletonSolverBase::_getRowName(int, std::string &) const {}
deba@482:   void SkeletonSolverBase::_setRowName(int, const std::string &) {}
deba@482:   int SkeletonSolverBase::_rowByName(const std::string&) const { return -1; }
deba@482: 
deba@482:   void SkeletonSolverBase::_setRowCoeffs(int, ExprIterator, ExprIterator) {}
deba@482:   void SkeletonSolverBase::_getRowCoeffs(int, InsertIterator) const {}
deba@482: 
deba@482:   void SkeletonSolverBase::_setColCoeffs(int, ExprIterator, ExprIterator) {}
deba@482:   void SkeletonSolverBase::_getColCoeffs(int, InsertIterator) const {}
deba@482: 
deba@482:   void SkeletonSolverBase::_setCoeff(int, int, Value) {}
deba@482:   SkeletonSolverBase::Value SkeletonSolverBase::_getCoeff(int, int) const
deba@482:   { return 0; }
deba@482: 
deba@482:   void SkeletonSolverBase::_setColLowerBound(int, Value) {}
deba@482:   SkeletonSolverBase::Value SkeletonSolverBase::_getColLowerBound(int) const
deba@482:   {  return 0; }
deba@482: 
deba@482:   void SkeletonSolverBase::_setColUpperBound(int, Value) {}
deba@482:   SkeletonSolverBase::Value SkeletonSolverBase::_getColUpperBound(int) const
deba@482:   {  return 0; }
deba@482: 
deba@482:   void SkeletonSolverBase::_setRowLowerBound(int, Value) {}
deba@482:   SkeletonSolverBase::Value SkeletonSolverBase::_getRowLowerBound(int) const
deba@482:   {  return 0; }
deba@482: 
deba@482:   void SkeletonSolverBase::_setRowUpperBound(int, Value) {}
deba@482:   SkeletonSolverBase::Value SkeletonSolverBase::_getRowUpperBound(int) const
deba@482:   {  return 0; }
deba@482: 
deba@482:   void SkeletonSolverBase::_setObjCoeffs(ExprIterator, ExprIterator) {}
deba@482:   void SkeletonSolverBase::_getObjCoeffs(InsertIterator) const {};
deba@482: 
deba@482:   void SkeletonSolverBase::_setObjCoeff(int, Value) {}
deba@482:   SkeletonSolverBase::Value SkeletonSolverBase::_getObjCoeff(int) const
deba@482:   {  return 0; }
deba@482: 
deba@482:   void SkeletonSolverBase::_setSense(Sense) {}
deba@482:   SkeletonSolverBase::Sense SkeletonSolverBase::_getSense() const
deba@482:   { return MIN; }
deba@482: 
deba@482:   void SkeletonSolverBase::_clear() {
deba@482:     row_num = col_num = 0;
deba@481:   }
deba@481: 
deba@623:   void SkeletonSolverBase::_messageLevel(MessageLevel) {}
deba@623: 
deba@482:   LpSkeleton::SolveExitStatus LpSkeleton::_solve() { return SOLVED; }
deba@481: 
deba@482:   LpSkeleton::Value LpSkeleton::_getPrimal(int) const { return 0; }
deba@482:   LpSkeleton::Value LpSkeleton::_getDual(int) const { return 0; }
deba@482:   LpSkeleton::Value LpSkeleton::_getPrimalValue() const { return 0; }
deba@481: 
deba@482:   LpSkeleton::Value LpSkeleton::_getPrimalRay(int) const { return 0; }
deba@482:   LpSkeleton::Value LpSkeleton::_getDualRay(int) const { return 0; }
deba@481: 
deba@482:   LpSkeleton::ProblemType LpSkeleton::_getPrimalType() const
deba@482:   { return UNDEFINED; }
deba@481: 
deba@482:   LpSkeleton::ProblemType LpSkeleton::_getDualType() const
deba@482:   { return UNDEFINED; }
deba@481: 
deba@482:   LpSkeleton::VarStatus LpSkeleton::_getColStatus(int) const
deba@482:   { return BASIC; }
deba@481: 
deba@482:   LpSkeleton::VarStatus LpSkeleton::_getRowStatus(int) const
deba@482:   { return BASIC; }
deba@481: 
alpar@587:   LpSkeleton* LpSkeleton::newSolver() const
deba@482:   { return static_cast<LpSkeleton*>(0); }
deba@481: 
alpar@587:   LpSkeleton* LpSkeleton::cloneSolver() const
deba@482:   { return static_cast<LpSkeleton*>(0); }
deba@481: 
deba@482:   const char* LpSkeleton::_solverName() const { return "LpSkeleton"; }
deba@481: 
deba@482:   MipSkeleton::SolveExitStatus MipSkeleton::_solve()
deba@482:   { return SOLVED; }
deba@481: 
deba@482:   MipSkeleton::Value MipSkeleton::_getSol(int) const { return 0; }
deba@482:   MipSkeleton::Value MipSkeleton::_getSolValue() const { return 0; }
deba@481: 
deba@482:   MipSkeleton::ProblemType MipSkeleton::_getType() const
deba@482:   { return UNDEFINED; }
deba@481: 
alpar@587:   MipSkeleton* MipSkeleton::newSolver() const
deba@482:   { return static_cast<MipSkeleton*>(0); }
deba@481: 
alpar@587:   MipSkeleton* MipSkeleton::cloneSolver() const
deba@482:   { return static_cast<MipSkeleton*>(0); }
deba@481: 
deba@482:   const char* MipSkeleton::_solverName() const { return "MipSkeleton"; }
deba@481: 
deba@481: } //namespace lemon
deba@481: