[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 |
---|
| 6 | * (Egervary Combinatorial Optimization Research Group, EGRES). |
---|
| 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 | |
---|
[1313] | 24 | int LpSkeleton::_addCol() |
---|
[1254] | 25 | { |
---|
[1273] | 26 | return ++col_num; |
---|
[1254] | 27 | } |
---|
| 28 | |
---|
[1313] | 29 | int LpSkeleton::_addRow() |
---|
[1254] | 30 | { |
---|
[1273] | 31 | return ++row_num; |
---|
[1254] | 32 | } |
---|
| 33 | |
---|
[1313] | 34 | void LpSkeleton::_setRowCoeffs(int i, |
---|
[1254] | 35 | int length, |
---|
| 36 | int const * indices, |
---|
| 37 | Value const * values ) |
---|
| 38 | { |
---|
| 39 | } |
---|
| 40 | |
---|
[1313] | 41 | void LpSkeleton::_setColCoeffs(int i, |
---|
[1254] | 42 | int length, |
---|
| 43 | int const * indices, |
---|
| 44 | Value const * values) |
---|
| 45 | { |
---|
| 46 | } |
---|
| 47 | |
---|
[1313] | 48 | void LpSkeleton::_setColLowerBound(int i, Value value) |
---|
[1254] | 49 | { |
---|
| 50 | } |
---|
| 51 | |
---|
[1313] | 52 | void LpSkeleton::_setColUpperBound(int i, Value value) |
---|
[1254] | 53 | { |
---|
| 54 | } |
---|
| 55 | |
---|
[1313] | 56 | void LpSkeleton::_setRowLowerBound(int i, Value value) |
---|
[1254] | 57 | { |
---|
| 58 | } |
---|
| 59 | |
---|
[1313] | 60 | void LpSkeleton::_setRowUpperBound(int i, Value value) |
---|
[1254] | 61 | { |
---|
| 62 | } |
---|
| 63 | |
---|
[1313] | 64 | void LpSkeleton::_setObjCoeff(int i, Value obj_coef) |
---|
[1254] | 65 | { |
---|
| 66 | } |
---|
[1263] | 67 | |
---|
[1313] | 68 | void LpSkeleton::_setMax() |
---|
[1312] | 69 | { |
---|
| 70 | } |
---|
[1313] | 71 | void LpSkeleton::_setMin() |
---|
[1312] | 72 | { |
---|
| 73 | } |
---|
| 74 | |
---|
[1313] | 75 | LpSkeleton::SolveExitStatus LpSkeleton::_solve() |
---|
[1263] | 76 | { |
---|
[1293] | 77 | return SOLVED; |
---|
[1263] | 78 | } |
---|
| 79 | |
---|
[1313] | 80 | LpSkeleton::Value LpSkeleton::_getPrimal(int i) |
---|
[1263] | 81 | { |
---|
| 82 | return 0; |
---|
| 83 | } |
---|
[1254] | 84 | |
---|
[1313] | 85 | LpSkeleton::Value LpSkeleton::_getPrimalValue() |
---|
[1312] | 86 | { |
---|
| 87 | return 0; |
---|
| 88 | } |
---|
| 89 | |
---|
[1313] | 90 | LpSkeleton::SolutionStatus LpSkeleton::_getPrimalStatus() |
---|
[1294] | 91 | { |
---|
| 92 | return OPTIMAL; |
---|
| 93 | } |
---|
| 94 | |
---|
[1254] | 95 | } //namespace lemon |
---|
| 96 | |
---|