1 /* -*- C++ -*- |
1 /* -*- C++ -*- |
2 * src/lemon/lp_solver_skeleton.cc |
2 * src/lemon/lp_skeleton.cc |
3 * - Part of LEMON, a generic C++ optimization library |
3 * - Part of LEMON, a generic C++ optimization library |
4 * |
4 * |
5 * Copyright (C) 2005 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
5 * Copyright (C) 2005 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
6 * (Egervary Combinatorial Optimization Research Group, EGRES). |
6 * (Egervary Combinatorial Optimization Research Group, EGRES). |
7 * |
7 * |
13 * express or implied, and with no claim as to its suitability for any |
13 * express or implied, and with no claim as to its suitability for any |
14 * purpose. |
14 * purpose. |
15 * |
15 * |
16 */ |
16 */ |
17 |
17 |
18 #include <lemon/lp_solver_skeleton.h> |
18 #include <lemon/lp_skeleton.h> |
19 |
19 |
20 ///\file |
20 ///\file |
21 ///\brief A skeleton file to implement LP solver interfaces |
21 ///\brief A skeleton file to implement LP solver interfaces |
22 namespace lemon { |
22 namespace lemon { |
23 |
23 |
24 int LpSolverSkeleton::_addCol() |
24 int LpSkeleton::_addCol() |
25 { |
25 { |
26 return ++col_num; |
26 return ++col_num; |
27 } |
27 } |
28 |
28 |
29 int LpSolverSkeleton::_addRow() |
29 int LpSkeleton::_addRow() |
30 { |
30 { |
31 return ++row_num; |
31 return ++row_num; |
32 } |
32 } |
33 |
33 |
34 void LpSolverSkeleton::_setRowCoeffs(int i, |
34 void LpSkeleton::_setRowCoeffs(int i, |
35 int length, |
35 int length, |
36 int const * indices, |
36 int const * indices, |
37 Value const * values ) |
37 Value const * values ) |
38 { |
38 { |
39 } |
39 } |
40 |
40 |
41 void LpSolverSkeleton::_setColCoeffs(int i, |
41 void LpSkeleton::_setColCoeffs(int i, |
42 int length, |
42 int length, |
43 int const * indices, |
43 int const * indices, |
44 Value const * values) |
44 Value const * values) |
45 { |
45 { |
46 } |
46 } |
47 |
47 |
48 void LpSolverSkeleton::_setColLowerBound(int i, Value value) |
48 void LpSkeleton::_setColLowerBound(int i, Value value) |
49 { |
49 { |
50 } |
50 } |
51 |
51 |
52 void LpSolverSkeleton::_setColUpperBound(int i, Value value) |
52 void LpSkeleton::_setColUpperBound(int i, Value value) |
53 { |
53 { |
54 } |
54 } |
55 |
55 |
56 void LpSolverSkeleton::_setRowLowerBound(int i, Value value) |
56 void LpSkeleton::_setRowLowerBound(int i, Value value) |
57 { |
57 { |
58 } |
58 } |
59 |
59 |
60 void LpSolverSkeleton::_setRowUpperBound(int i, Value value) |
60 void LpSkeleton::_setRowUpperBound(int i, Value value) |
61 { |
61 { |
62 } |
62 } |
63 |
63 |
64 void LpSolverSkeleton::_setObjCoeff(int i, Value obj_coef) |
64 void LpSkeleton::_setObjCoeff(int i, Value obj_coef) |
65 { |
65 { |
66 } |
66 } |
67 |
67 |
68 void LpSolverSkeleton::_setMax() |
68 void LpSkeleton::_setMax() |
69 { |
69 { |
70 } |
70 } |
71 void LpSolverSkeleton::_setMin() |
71 void LpSkeleton::_setMin() |
72 { |
72 { |
73 } |
73 } |
74 |
74 |
75 LpSolverSkeleton::SolveExitStatus LpSolverSkeleton::_solve() |
75 LpSkeleton::SolveExitStatus LpSkeleton::_solve() |
76 { |
76 { |
77 return SOLVED; |
77 return SOLVED; |
78 } |
78 } |
79 |
79 |
80 LpSolverSkeleton::Value LpSolverSkeleton::_getPrimal(int i) |
80 LpSkeleton::Value LpSkeleton::_getPrimal(int i) |
81 { |
81 { |
82 return 0; |
82 return 0; |
83 } |
83 } |
84 |
84 |
85 LpSolverSkeleton::Value LpSolverSkeleton::_getPrimalValue() |
85 LpSkeleton::Value LpSkeleton::_getPrimalValue() |
86 { |
86 { |
87 return 0; |
87 return 0; |
88 } |
88 } |
89 |
89 |
90 LpSolverSkeleton::SolutionStatus LpSolverSkeleton::_getPrimalStatus() |
90 LpSkeleton::SolutionStatus LpSkeleton::_getPrimalStatus() |
91 { |
91 { |
92 return OPTIMAL; |
92 return OPTIMAL; |
93 } |
93 } |
94 |
94 |
95 } //namespace lemon |
95 } //namespace lemon |