0
5
0
... | ... |
@@ -4,3 +4,3 @@ |
4 | 4 |
* |
5 |
* Copyright (C) 2003- |
|
5 |
* Copyright (C) 2003-2009 |
|
6 | 6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
... | ... |
@@ -443,9 +443,9 @@ |
443 | 443 |
CplexLp::CplexLp() |
444 |
: LpBase(), |
|
444 |
: LpBase(), LpSolver(), CplexBase() {} |
|
445 | 445 |
|
446 | 446 |
CplexLp::CplexLp(const CplexEnv& env) |
447 |
: LpBase(), |
|
447 |
: LpBase(), LpSolver(), CplexBase(env) {} |
|
448 | 448 |
|
449 | 449 |
CplexLp::CplexLp(const CplexLp& other) |
450 |
: LpBase(), |
|
450 |
: LpBase(), LpSolver(), CplexBase(other) {} |
|
451 | 451 |
|
... | ... |
@@ -800,3 +800,3 @@ |
800 | 800 |
CplexMip::CplexMip() |
801 |
: LpBase(), |
|
801 |
: LpBase(), MipSolver(), CplexBase() { |
|
802 | 802 |
|
... | ... |
@@ -810,3 +810,3 @@ |
810 | 810 |
CplexMip::CplexMip(const CplexEnv& env) |
811 |
: LpBase(), |
|
811 |
: LpBase(), MipSolver(), CplexBase(env) { |
|
812 | 812 |
|
... | ... |
@@ -821,3 +821,3 @@ |
821 | 821 |
CplexMip::CplexMip(const CplexMip& other) |
822 |
: LpBase(), |
|
822 |
: LpBase(), MipSolver(), CplexBase(other) {} |
|
823 | 823 |
... | ... |
@@ -4,3 +4,3 @@ |
4 | 4 |
* |
5 |
* Copyright (C) 2003- |
|
5 |
* Copyright (C) 2003-2009 |
|
6 | 6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
... | ... |
@@ -80,3 +80,3 @@ |
80 | 80 |
/// This class implements the common interface of the CPLEX LP and |
81 |
/// MIP solvers. |
|
81 |
/// MIP solvers. |
|
82 | 82 |
/// \ingroup lp_group |
... | ... |
@@ -237,6 +237,9 @@ |
237 | 237 |
|
238 |
/// \e |
|
239 |
virtual CplexMip* cloneSolver() const; |
|
240 |
/// \e |
|
241 |
virtual CplexMip* newSolver() const; |
|
242 |
|
|
238 | 243 |
protected: |
239 | 244 |
|
240 |
virtual CplexMip* _cloneSolver() const; |
|
241 |
virtual CplexMip* _newSolver() const; |
|
242 | 245 |
... | ... |
@@ -4,3 +4,3 @@ |
4 | 4 |
* |
5 |
* Copyright (C) 2003- |
|
5 |
* Copyright (C) 2003-2009 |
|
6 | 6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
... | ... |
@@ -533,3 +533,3 @@ |
533 | 533 |
GlpkLp::GlpkLp() |
534 |
: LpBase(), |
|
534 |
: LpBase(), LpSolver(), GlpkBase() { |
|
535 | 535 |
messageLevel(MESSAGE_NO_OUTPUT); |
... | ... |
@@ -538,3 +538,3 @@ |
538 | 538 |
GlpkLp::GlpkLp(const GlpkLp& other) |
539 |
: LpBase(other), |
|
539 |
: LpBase(other), LpSolver(other), GlpkBase(other) { |
|
540 | 540 |
messageLevel(MESSAGE_NO_OUTPUT); |
... | ... |
@@ -832,3 +832,3 @@ |
832 | 832 |
GlpkMip::GlpkMip() |
833 |
: LpBase(), |
|
833 |
: LpBase(), MipSolver(), GlpkBase() { |
|
834 | 834 |
messageLevel(MESSAGE_NO_OUTPUT); |
... | ... |
@@ -837,3 +837,3 @@ |
837 | 837 |
GlpkMip::GlpkMip(const GlpkMip& other) |
838 |
: LpBase(), |
|
838 |
: LpBase(), MipSolver(), GlpkBase(other) { |
|
839 | 839 |
messageLevel(MESSAGE_NO_OUTPUT); |
... | ... |
@@ -4,3 +4,3 @@ |
4 | 4 |
* |
5 |
* Copyright (C) 2003- |
|
5 |
* Copyright (C) 2003-2009 |
|
6 | 6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
... | ... |
@@ -367,3 +367,3 @@ |
367 | 367 |
//Test for clone/new |
368 |
|
|
368 |
|
|
369 | 369 |
LP* lp = new LP(); |
... | ... |
@@ -395,2 +395,3 @@ |
395 | 395 |
aTest(lp_cplex2); |
396 |
cloneTest<CplexLp>(); |
|
396 | 397 |
} catch (CplexEnv::LicenseError& error) { |
... | ... |
@@ -403,3 +404,2 @@ |
403 | 404 |
} |
404 |
cloneTest<CplexLp>(); |
|
405 | 405 |
#endif |
... | ... |
@@ -4,3 +4,3 @@ |
4 | 4 |
* |
5 |
* Copyright (C) 2003- |
|
5 |
* Copyright (C) 2003-2009 |
|
6 | 6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
... | ... |
@@ -111,3 +111,3 @@ |
111 | 111 |
{ |
112 |
|
|
112 |
|
|
113 | 113 |
MIP* mip = new MIP(); |
... | ... |
@@ -135,2 +135,3 @@ |
135 | 135 |
aTest(mip2); |
136 |
cloneTest<CplexMip>(); |
|
136 | 137 |
} catch (CplexEnv::LicenseError& error) { |
... | ... |
@@ -143,3 +144,2 @@ |
143 | 144 |
} |
144 |
cloneTest<CplexMip>(); |
|
145 | 145 |
#endif |
0 comments (0 inline)