src/work/athos/lp/lp_solver_skeleton.cc
author alpar
Fri, 25 Mar 2005 18:56:07 +0000
changeset 1264 92ba3e62825d
parent 1254 c9558638fe42
child 1273 2b2ffa625775
permissions -rw-r--r--
Constraints (expressions containing <= or >=) can be passed to addRow()
and setRow()
alpar@1254
     1
/* -*- C++ -*-
alpar@1254
     2
 * src/lemon/lp_solver_skeleton.cc
alpar@1254
     3
 * - Part of LEMON, a generic C++ optimization library
alpar@1254
     4
 *
alpar@1254
     5
 * Copyright (C) 2005 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
alpar@1254
     6
 * (Egervary Combinatorial Optimization Research Group, EGRES).
alpar@1254
     7
 *
alpar@1254
     8
 * Permission to use, modify and distribute this software is granted
alpar@1254
     9
 * provided that this copyright notice appears in all copies. For
alpar@1254
    10
 * precise terms see the accompanying LICENSE file.
alpar@1254
    11
 *
alpar@1254
    12
 * This software is provided "AS IS" with no warranty of any kind,
alpar@1254
    13
 * express or implied, and with no claim as to its suitability for any
alpar@1254
    14
 * purpose.
alpar@1254
    15
 *
alpar@1254
    16
 */
alpar@1254
    17
alpar@1254
    18
#include"lp_solver_skeleton.h"
alpar@1254
    19
alpar@1254
    20
///\file
alpar@1254
    21
///\brief A skeleton file to implement LP solver interfaces
alpar@1254
    22
namespace lemon {
alpar@1254
    23
  
alpar@1254
    24
  int LpSolverSkeleton::_addCol()
alpar@1254
    25
  {
alpar@1254
    26
    return 1;
alpar@1254
    27
  }
alpar@1254
    28
  
alpar@1254
    29
  int LpSolverSkeleton::_addRow() 
alpar@1254
    30
  {
alpar@1254
    31
    return 1;
alpar@1254
    32
  }
alpar@1254
    33
  
alpar@1254
    34
  void LpSolverSkeleton::_setRowCoeffs(int i, 
alpar@1254
    35
					       int length,
alpar@1254
    36
					       int  const * indices, 
alpar@1254
    37
					       Value  const * values )
alpar@1254
    38
  {
alpar@1254
    39
  }
alpar@1254
    40
  
alpar@1254
    41
  void LpSolverSkeleton::_setColCoeffs(int i, 
alpar@1254
    42
					       int length,
alpar@1254
    43
					       int  const * indices, 
alpar@1254
    44
					       Value  const * values)
alpar@1254
    45
  {
alpar@1254
    46
  }
alpar@1254
    47
  
alpar@1254
    48
  void LpSolverSkeleton::_setColLowerBound(int i, Value value)
alpar@1254
    49
  {
alpar@1254
    50
  }
alpar@1254
    51
  
alpar@1254
    52
  void LpSolverSkeleton::_setColUpperBound(int i, Value value)
alpar@1254
    53
  {
alpar@1254
    54
  }
alpar@1254
    55
  
alpar@1254
    56
  void LpSolverSkeleton::_setRowLowerBound(int i, Value value)
alpar@1254
    57
  {
alpar@1254
    58
  }
alpar@1254
    59
  
alpar@1254
    60
  void LpSolverSkeleton::_setRowUpperBound(int i, Value value)
alpar@1254
    61
  {
alpar@1254
    62
  }
alpar@1254
    63
  
alpar@1254
    64
  void LpSolverSkeleton::_setObjCoeff(int i, Value obj_coef)
alpar@1254
    65
  {
alpar@1254
    66
  }
alpar@1263
    67
alpar@1263
    68
  LpSolverSkeleton::SolutionType LpSolverSkeleton::_solve()
alpar@1263
    69
  {
alpar@1263
    70
    return OPTIMAL;
alpar@1263
    71
  }
alpar@1263
    72
alpar@1263
    73
  LpSolverSkeleton::Value LpSolverSkeleton::_getSolution(int i)
alpar@1263
    74
  {
alpar@1263
    75
    return 0;
alpar@1263
    76
  }
alpar@1254
    77
  
alpar@1254
    78
} //namespace lemon
alpar@1254
    79