[1254] | 1 | /* -*- C++ -*- |
---|
[1313] | 2 | * src/lemon/lp_skeleton.cc |
---|
[1254] | 3 | * - Part of LEMON, a generic C++ optimization library |
---|
| 4 | * |
---|
| 5 | * Copyright (C) 2005 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
---|
[1359] | 6 | * (Egervary Research Group on Combinatorial Optimization, EGRES). |
---|
[1254] | 7 | * |
---|
| 8 | * Permission to use, modify and distribute this software is granted |
---|
| 9 | * provided that this copyright notice appears in all copies. For |
---|
| 10 | * precise terms see the accompanying LICENSE file. |
---|
| 11 | * |
---|
| 12 | * This software is provided "AS IS" with no warranty of any kind, |
---|
| 13 | * express or implied, and with no claim as to its suitability for any |
---|
| 14 | * purpose. |
---|
| 15 | * |
---|
| 16 | */ |
---|
| 17 | |
---|
[1313] | 18 | #include <lemon/lp_skeleton.h> |
---|
[1254] | 19 | |
---|
| 20 | ///\file |
---|
| 21 | ///\brief A skeleton file to implement LP solver interfaces |
---|
| 22 | namespace lemon { |
---|
| 23 | |
---|
[1364] | 24 | LpSolverBase &LpSkeleton::_newLp() |
---|
| 25 | { |
---|
[1368] | 26 | LpSolverBase *tmp=0; |
---|
| 27 | return *tmp; |
---|
[1364] | 28 | } |
---|
| 29 | |
---|
| 30 | LpSolverBase &LpSkeleton::_copyLp() |
---|
| 31 | { |
---|
[1368] | 32 | LpSolverBase *tmp=0; |
---|
| 33 | return *tmp; |
---|
[1364] | 34 | } |
---|
| 35 | |
---|
[1313] | 36 | int LpSkeleton::_addCol() |
---|
[1254] | 37 | { |
---|
[1273] | 38 | return ++col_num; |
---|
[1254] | 39 | } |
---|
| 40 | |
---|
[1313] | 41 | int LpSkeleton::_addRow() |
---|
[1254] | 42 | { |
---|
[1273] | 43 | return ++row_num; |
---|
[1254] | 44 | } |
---|
| 45 | |
---|
[1362] | 46 | void LpSkeleton::_setRowCoeffs(int, |
---|
| 47 | int, |
---|
| 48 | int const *, |
---|
| 49 | Value const *) |
---|
[1254] | 50 | { |
---|
| 51 | } |
---|
| 52 | |
---|
[1362] | 53 | void LpSkeleton::_setColCoeffs(int, |
---|
| 54 | int, |
---|
| 55 | int const *, |
---|
| 56 | Value const *) |
---|
[1254] | 57 | { |
---|
| 58 | } |
---|
| 59 | |
---|
[1362] | 60 | void LpSkeleton::_setColLowerBound(int, Value) |
---|
[1254] | 61 | { |
---|
| 62 | } |
---|
| 63 | |
---|
[1362] | 64 | void LpSkeleton::_setColUpperBound(int, Value) |
---|
[1254] | 65 | { |
---|
| 66 | } |
---|
| 67 | |
---|
[1362] | 68 | void LpSkeleton::_setRowLowerBound(int, Value) |
---|
[1254] | 69 | { |
---|
| 70 | } |
---|
| 71 | |
---|
[1362] | 72 | void LpSkeleton::_setRowUpperBound(int, Value) |
---|
[1254] | 73 | { |
---|
| 74 | } |
---|
[1389] | 75 | |
---|
[1390] | 76 | void LpSkeleton::_setRowBounds(int, Value, Value) |
---|
[1389] | 77 | { |
---|
| 78 | } |
---|
[1254] | 79 | |
---|
[1362] | 80 | void LpSkeleton::_setObjCoeff(int, Value) |
---|
[1254] | 81 | { |
---|
| 82 | } |
---|
[1263] | 83 | |
---|
[1313] | 84 | void LpSkeleton::_setMax() |
---|
[1312] | 85 | { |
---|
| 86 | } |
---|
[1390] | 87 | |
---|
[1313] | 88 | void LpSkeleton::_setMin() |
---|
[1312] | 89 | { |
---|
| 90 | } |
---|
| 91 | |
---|
[1390] | 92 | void LpSkeleton::_clearObj() |
---|
| 93 | { |
---|
| 94 | } |
---|
| 95 | |
---|
[1313] | 96 | LpSkeleton::SolveExitStatus LpSkeleton::_solve() |
---|
[1263] | 97 | { |
---|
[1293] | 98 | return SOLVED; |
---|
[1263] | 99 | } |
---|
| 100 | |
---|
[1362] | 101 | LpSkeleton::Value LpSkeleton::_getPrimal(int) |
---|
[1263] | 102 | { |
---|
| 103 | return 0; |
---|
| 104 | } |
---|
[1254] | 105 | |
---|
[1313] | 106 | LpSkeleton::Value LpSkeleton::_getPrimalValue() |
---|
[1312] | 107 | { |
---|
| 108 | return 0; |
---|
| 109 | } |
---|
| 110 | |
---|
[1313] | 111 | LpSkeleton::SolutionStatus LpSkeleton::_getPrimalStatus() |
---|
[1294] | 112 | { |
---|
| 113 | return OPTIMAL; |
---|
| 114 | } |
---|
| 115 | |
---|
[1254] | 116 | } //namespace lemon |
---|
| 117 | |
---|