|
alpar@1254
|
1 |
/* -*- C++ -*-
|
|
alpar@1313
|
2 |
* src/lemon/lp_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@1313
|
18 |
#include <lemon/lp_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@1313
|
24 |
int LpSkeleton::_addCol()
|
|
alpar@1254
|
25 |
{
|
|
alpar@1273
|
26 |
return ++col_num;
|
|
alpar@1254
|
27 |
}
|
|
alpar@1254
|
28 |
|
|
alpar@1313
|
29 |
int LpSkeleton::_addRow()
|
|
alpar@1254
|
30 |
{
|
|
alpar@1273
|
31 |
return ++row_num;
|
|
alpar@1254
|
32 |
}
|
|
alpar@1254
|
33 |
|
|
alpar@1313
|
34 |
void LpSkeleton::_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@1313
|
41 |
void LpSkeleton::_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@1313
|
48 |
void LpSkeleton::_setColLowerBound(int i, Value value)
|
|
alpar@1254
|
49 |
{
|
|
alpar@1254
|
50 |
}
|
|
alpar@1254
|
51 |
|
|
alpar@1313
|
52 |
void LpSkeleton::_setColUpperBound(int i, Value value)
|
|
alpar@1254
|
53 |
{
|
|
alpar@1254
|
54 |
}
|
|
alpar@1254
|
55 |
|
|
alpar@1313
|
56 |
void LpSkeleton::_setRowLowerBound(int i, Value value)
|
|
alpar@1254
|
57 |
{
|
|
alpar@1254
|
58 |
}
|
|
alpar@1254
|
59 |
|
|
alpar@1313
|
60 |
void LpSkeleton::_setRowUpperBound(int i, Value value)
|
|
alpar@1254
|
61 |
{
|
|
alpar@1254
|
62 |
}
|
|
alpar@1254
|
63 |
|
|
alpar@1313
|
64 |
void LpSkeleton::_setObjCoeff(int i, Value obj_coef)
|
|
alpar@1254
|
65 |
{
|
|
alpar@1254
|
66 |
}
|
|
alpar@1263
|
67 |
|
|
alpar@1313
|
68 |
void LpSkeleton::_setMax()
|
|
alpar@1312
|
69 |
{
|
|
alpar@1312
|
70 |
}
|
|
alpar@1313
|
71 |
void LpSkeleton::_setMin()
|
|
alpar@1312
|
72 |
{
|
|
alpar@1312
|
73 |
}
|
|
alpar@1312
|
74 |
|
|
alpar@1313
|
75 |
LpSkeleton::SolveExitStatus LpSkeleton::_solve()
|
|
alpar@1263
|
76 |
{
|
|
alpar@1293
|
77 |
return SOLVED;
|
|
alpar@1263
|
78 |
}
|
|
alpar@1263
|
79 |
|
|
alpar@1313
|
80 |
LpSkeleton::Value LpSkeleton::_getPrimal(int i)
|
|
alpar@1263
|
81 |
{
|
|
alpar@1263
|
82 |
return 0;
|
|
alpar@1263
|
83 |
}
|
|
alpar@1254
|
84 |
|
|
alpar@1313
|
85 |
LpSkeleton::Value LpSkeleton::_getPrimalValue()
|
|
alpar@1312
|
86 |
{
|
|
alpar@1312
|
87 |
return 0;
|
|
alpar@1312
|
88 |
}
|
|
alpar@1312
|
89 |
|
|
alpar@1313
|
90 |
LpSkeleton::SolutionStatus LpSkeleton::_getPrimalStatus()
|
|
alpar@1294
|
91 |
{
|
|
alpar@1294
|
92 |
return OPTIMAL;
|
|
alpar@1294
|
93 |
}
|
|
alpar@1294
|
94 |
|
|
alpar@1254
|
95 |
} //namespace lemon
|
|
alpar@1254
|
96 |
|