1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
|
// $Id: CbcSubProblem.cpp 1899 2013-04-09 18:12:08Z stefan $
// Copyright (C) 2002, International Business Machines
// Corporation and others. All Rights Reserved.
// This code is licensed under the terms of the Eclipse Public License (EPL).
// Edwin 11/10/2009-- carved out of CbcBranchActual
#include <cassert>
#include <cstdlib>
#include <cmath>
#include <cfloat>
//#define CBC_DEBUG
#include "CoinPragma.hpp"
#include "CoinTypes.hpp"
#include "OsiSolverInterface.hpp"
#include "OsiSolverBranch.hpp"
#include "CbcModel.hpp"
#include "CbcMessage.hpp"
#include "CbcSubProblem.hpp"
#include "CbcBranchActual.hpp"
#include "CoinSort.hpp"
#include "CoinError.hpp"
#ifdef COIN_HAS_CLP
#include "OsiClpSolverInterface.hpp"
#endif
// Default Constructor
CbcSubProblem::CbcSubProblem()
: objectiveValue_(0.0),
sumInfeasibilities_(0.0),
branchValue_(0.0),
djValue_(0.0),
variables_(NULL),
newBounds_(NULL),
status_(NULL),
depth_(0),
numberChangedBounds_(0),
numberInfeasibilities_(0),
problemStatus_(0),
branchVariable_(0)
{
}
// Useful constructor
CbcSubProblem::CbcSubProblem (const OsiSolverInterface * solver,
const double * lastLower,
const double * lastUpper,
const unsigned char * status,
int depth)
: objectiveValue_(0.0),
sumInfeasibilities_(0.0),
branchValue_(0.0),
djValue_(0.0),
variables_(NULL),
newBounds_(NULL),
status_(NULL),
depth_(depth),
numberChangedBounds_(0),
numberInfeasibilities_(0),
problemStatus_(0),
branchVariable_(0)
{
const double * lower = solver->getColLower();
const double * upper = solver->getColUpper();
numberChangedBounds_ = 0;
int numberColumns = solver->getNumCols();
int i;
for (i = 0; i < numberColumns; i++) {
if (lower[i] != lastLower[i])
numberChangedBounds_++;
if (upper[i] != lastUpper[i])
numberChangedBounds_++;
}
if (numberChangedBounds_) {
newBounds_ = new double [numberChangedBounds_] ;
variables_ = new int [numberChangedBounds_] ;
numberChangedBounds_ = 0;
for (i = 0; i < numberColumns; i++) {
if (lower[i] != lastLower[i]) {
variables_[numberChangedBounds_] = i;
newBounds_[numberChangedBounds_++] = lower[i];
}
if (upper[i] != lastUpper[i]) {
variables_[numberChangedBounds_] = i | 0x80000000;
newBounds_[numberChangedBounds_++] = upper[i];
}
#ifdef CBC_DEBUG
if (lower[i] != lastLower[i]) {
std::cout
<< "lower on " << i << " changed from "
<< lastLower[i] << " to " << lower[i] << std::endl ;
}
if (upper[i] != lastUpper[i]) {
std::cout
<< "upper on " << i << " changed from "
<< lastUpper[i] << " to " << upper[i] << std::endl ;
}
#endif
}
#ifdef CBC_DEBUG
std::cout << numberChangedBounds_ << " changed bounds." << std::endl ;
#endif
}
const OsiClpSolverInterface * clpSolver
= dynamic_cast<const OsiClpSolverInterface *> (solver);
assert (clpSolver);
// Do difference
// Current basis
status_ = clpSolver->getBasis(status);
assert (status_->fullBasis());
//status_->print();
}
// Copy constructor
CbcSubProblem::CbcSubProblem ( const CbcSubProblem & rhs)
: objectiveValue_(rhs.objectiveValue_),
sumInfeasibilities_(rhs.sumInfeasibilities_),
branchValue_(rhs.branchValue_),
djValue_(rhs.djValue_),
variables_(NULL),
newBounds_(NULL),
status_(NULL),
depth_(rhs.depth_),
numberChangedBounds_(rhs.numberChangedBounds_),
numberInfeasibilities_(rhs.numberInfeasibilities_),
problemStatus_(rhs.problemStatus_),
branchVariable_(rhs.branchVariable_)
{
if (numberChangedBounds_) {
variables_ = CoinCopyOfArray(rhs.variables_, numberChangedBounds_);
newBounds_ = CoinCopyOfArray(rhs.newBounds_, numberChangedBounds_);
}
if (rhs.status_) {
status_ = new CoinWarmStartBasis(*rhs.status_);
}
}
// Assignment operator
CbcSubProblem &
CbcSubProblem::operator=( const CbcSubProblem & rhs)
{
if (this != &rhs) {
delete [] variables_;
delete [] newBounds_;
delete status_;
objectiveValue_ = rhs.objectiveValue_;
sumInfeasibilities_ = rhs.sumInfeasibilities_;
branchValue_ = rhs.branchValue_;
djValue_ = rhs.djValue_;
depth_ = rhs.depth_;
numberChangedBounds_ = rhs.numberChangedBounds_;
numberInfeasibilities_ = rhs.numberInfeasibilities_;
problemStatus_ = rhs.problemStatus_;
branchVariable_ = rhs.branchVariable_;
if (numberChangedBounds_) {
variables_ = CoinCopyOfArray(rhs.variables_, numberChangedBounds_);
newBounds_ = CoinCopyOfArray(rhs.newBounds_, numberChangedBounds_);
} else {
variables_ = NULL;
newBounds_ = NULL;
}
if (rhs.status_) {
status_ = new CoinWarmStartBasis(*rhs.status_);
} else {
status_ = NULL;
}
}
return *this;
}
// Take over
void
CbcSubProblem::takeOver( CbcSubProblem & rhs, bool cleanUp)
{
if (this != &rhs) {
delete [] variables_;
delete [] newBounds_;
delete status_;
objectiveValue_ = rhs.objectiveValue_;
sumInfeasibilities_ = rhs.sumInfeasibilities_;
branchValue_ = rhs.branchValue_;
djValue_ = rhs.djValue_;
depth_ = rhs.depth_;
numberChangedBounds_ = rhs.numberChangedBounds_;
numberInfeasibilities_ = rhs.numberInfeasibilities_;
problemStatus_ = rhs.problemStatus_;
branchVariable_ = rhs.branchVariable_;
variables_ = rhs.variables_;
newBounds_ = rhs.newBounds_;
rhs.variables_ = NULL;
rhs.newBounds_ = NULL;
status_ = rhs.status_;
rhs.status_ = NULL;
if (cleanUp) {
delete [] variables_;
delete [] newBounds_;
variables_ = new int [1];
newBounds_ = new double [1];
// swap way and make only fix
numberChangedBounds_=1;
if ((problemStatus_&1)==0) {
// last way was down
newBounds_[0] = ceil(branchValue_);
variables_[0] = branchVariable_;
} else {
// last way was up
newBounds_[0] = floor(branchValue_);
variables_[0] = branchVariable_ | 0x80000000;
}
}
}
}
// Destructor
CbcSubProblem::~CbcSubProblem ()
{
delete [] variables_;
delete [] newBounds_;
delete status_;
}
// Apply subproblem
void
CbcSubProblem::apply(OsiSolverInterface * solver, int what) const
{
int i;
if ((what&1) != 0) {
printf("CbcSubapply depth %d column %d way %d bvalue %g obj %g\n",
this->depth_,this->branchVariable_,this->problemStatus_,
this->branchValue_,this->objectiveValue_);
printf("current bounds %g <= %g <= %g\n",solver->getColLower()[branchVariable_],branchValue_,solver->getColUpper()[branchVariable_]);
#ifndef NDEBUG
int nSame = 0;
#endif
for (i = 0; i < numberChangedBounds_; i++) {
int variable = variables_[i];
int k = variable & 0x3fffffff;
if ((variable&0x80000000) == 0) {
// lower bound changing
//#define CBC_PRINT2
#ifdef CBC_PRINT2
if (solver->getColLower()[k] != newBounds_[i])
printf("lower change for column %d - from %g to %g\n", k, solver->getColLower()[k], newBounds_[i]);
#endif
#ifndef NDEBUG
if ((variable&0x40000000) == 0 && true) {
double oldValue = solver->getColLower()[k];
assert (newBounds_[i] > oldValue - 1.0e-8);
if (newBounds_[i] < oldValue + 1.0e-8) {
#ifdef CBC_PRINT2
printf("bad null lower change for column %d - bound %g\n", k, oldValue);
#endif
if (newBounds_[i] == oldValue)
nSame++;
}
}
#endif
solver->setColLower(k, newBounds_[i]);
} else {
// upper bound changing
#ifdef CBC_PRINT2
if (solver->getColUpper()[k] != newBounds_[i])
printf("upper change for column %d - from %g to %g\n", k, solver->getColUpper()[k], newBounds_[i]);
#endif
#ifndef NDEBUG
if ((variable&0x40000000) == 0 && true) {
double oldValue = solver->getColUpper()[k];
assert (newBounds_[i] < oldValue + 1.0e-8);
if (newBounds_[i] > oldValue - 1.0e-8) {
#ifdef CBC_PRINT2
printf("bad null upper change for column %d - bound %g\n", k, oldValue);
#endif
if (newBounds_[i] == oldValue)
nSame++;
}
}
#endif
solver->setColUpper(k, newBounds_[i]);
}
}
#ifndef NDEBUG
#ifdef CBC_PRINT2
if (nSame && (nSame < numberChangedBounds_ || (what&3) != 3))
printf("%d changes out of %d redundant %d\n",
nSame, numberChangedBounds_, what);
else if (numberChangedBounds_ && what == 7 && !nSame)
printf("%d good changes %d\n",
numberChangedBounds_, what);
#endif
#endif
printf("new bounds %g <= %g <= %g\n",solver->getColLower()[branchVariable_],branchValue_,solver->getColUpper()[branchVariable_]);
}
#ifdef JJF_ZERO
if ((what&2) != 0) {
OsiClpSolverInterface * clpSolver
= dynamic_cast<OsiClpSolverInterface *> (solver);
assert (clpSolver);
//assert (clpSolver->getNumRows()==numberRows_);
//clpSolver->setBasis(*status_);
// Current basis
CoinWarmStartBasis * basis = clpSolver->getPointerToWarmStart();
printf("BBBB\n");
basis->print();
assert (basis->fullBasis());
basis->applyDiff(status_);
printf("diff applied %x\n", status_);
printf("CCCC\n");
basis->print();
assert (basis->fullBasis());
#ifndef NDEBUG
if (!basis->fullBasis())
printf("Debug this basis!!\n");
#endif
clpSolver->setBasis(*basis);
}
#endif
if ((what&8) != 0) {
OsiClpSolverInterface * clpSolver
= dynamic_cast<OsiClpSolverInterface *> (solver);
assert (clpSolver);
clpSolver->setBasis(*status_);
if ((what&16)==0) {
delete status_;
status_ = NULL;
}
}
}
|
