COIN-OR::LEMON - Graph Library

source: lemon-0.x/lemon/lp_skeleton.cc @ 1933:a876a3d6a4c7

Last change on this file since 1933:a876a3d6a4c7 was 1895:5b01801efbc0, checked in by Alpar Juttner, 14 years ago
  • colName() added (untested on CPLEX)
  • possibility to set lower/upper bounds of several cols at once
  • setObj() -> obj()
  • setRow() -> row()
File size: 2.6 KB
RevLine 
[1254]1/* -*- C++ -*-
[1435]2 * lemon/lp_skeleton.cc - Part of LEMON, a generic C++ optimization library
[1254]3 *
[1875]4 * Copyright (C) 2006 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
[1359]5 * (Egervary Research Group on Combinatorial Optimization, EGRES).
[1254]6 *
7 * Permission to use, modify and distribute this software is granted
8 * provided that this copyright notice appears in all copies. For
9 * precise terms see the accompanying LICENSE file.
10 *
11 * This software is provided "AS IS" with no warranty of any kind,
12 * express or implied, and with no claim as to its suitability for any
13 * purpose.
14 *
15 */
16
[1313]17#include <lemon/lp_skeleton.h>
[1254]18
19///\file
20///\brief A skeleton file to implement LP solver interfaces
21namespace lemon {
22 
[1364]23  LpSolverBase &LpSkeleton::_newLp()
24  {
[1368]25    LpSolverBase *tmp=0;
26    return *tmp;
[1364]27  }
28 
29  LpSolverBase &LpSkeleton::_copyLp()
30  {
[1368]31    LpSolverBase *tmp=0;
32    return *tmp;
[1364]33  }
34
[1313]35  int LpSkeleton::_addCol()
[1254]36  {
[1273]37    return ++col_num;
[1254]38  }
39 
[1313]40  int LpSkeleton::_addRow()
[1254]41  {
[1273]42    return ++row_num;
[1254]43  }
44 
[1432]45  void LpSkeleton::_eraseCol(int ) {
46  }
47 
48  void LpSkeleton::_eraseRow(int) {
49  }
50
[1895]51  void LpSkeleton::_getColName(int, std::string &) {
52  }
53 
54 
55  void LpSkeleton::_setColName(int, const std::string &) {
56  }
57 
58 
[1362]59  void LpSkeleton::_setRowCoeffs(int,
60                                 int,
61                                 int  const *,
62                                 Value  const *)
[1254]63  {
64  }
65 
[1362]66  void LpSkeleton::_setColCoeffs(int,
67                                 int,
68                                 int  const *,
69                                 Value  const *)
[1254]70  {
71  }
[1431]72
73  void LpSkeleton::_setCoeff(int, int, Value )
74  {
75  }
76
77
[1362]78  void LpSkeleton::_setColLowerBound(int, Value)
[1254]79  {
80  }
81 
[1362]82  void LpSkeleton::_setColUpperBound(int, Value)
[1254]83  {
84  }
85 
[1405]86//   void LpSkeleton::_setRowLowerBound(int, Value)
87//   {
88//   }
[1254]89 
[1405]90//   void LpSkeleton::_setRowUpperBound(int, Value)
91//   {
92//   }
[1389]93
[1390]94  void LpSkeleton::_setRowBounds(int, Value, Value)
[1389]95  {
96  }
[1254]97 
[1362]98  void LpSkeleton::_setObjCoeff(int, Value)
[1254]99  {
100  }
[1263]101
[1313]102  void LpSkeleton::_setMax()
[1312]103  {
104  }
[1390]105
[1313]106  void LpSkeleton::_setMin()
[1312]107  {
108  }
109
[1390]110  void LpSkeleton::_clearObj()
111  {
112  }
113 
[1313]114  LpSkeleton::SolveExitStatus LpSkeleton::_solve()
[1263]115  {
[1293]116    return SOLVED;
[1263]117  }
118
[1362]119  LpSkeleton::Value LpSkeleton::_getPrimal(int)
[1263]120  {
121    return 0;
122  }
[1254]123 
[1796]124  LpSkeleton::Value LpSkeleton::_getDual(int)
125  {
126    return 0;
127  }
128 
[1313]129  LpSkeleton::Value LpSkeleton::_getPrimalValue()
[1312]130  {
131    return 0;
132  }
133 
[1313]134  LpSkeleton::SolutionStatus LpSkeleton::_getPrimalStatus()
[1294]135  {
[1460]136    return UNDEFINED;
137  }
138
139  LpSkeleton::SolutionStatus LpSkeleton::_getDualStatus()
140  {
141    return UNDEFINED;
142  }
143
144  LpSkeleton::ProblemTypes LpSkeleton::_getProblemType()
145  {
146    return UNKNOWN;
[1294]147  }
[1843]148
[1855]149  bool LpSkeleton::_isBasicCol(int)
[1843]150  {
151    return true;
152  }
153
[1254]154} //namespace lemon
155
Note: See TracBrowser for help on using the repository browser.