Clp 1.16.9
Loading...
Searching...
No Matches
ClpDynamicMatrix.hpp
Go to the documentation of this file.
1/* $Id: ClpDynamicMatrix.hpp 1755 2011-06-28 18:24:31Z lou $ */
2// Copyright (C) 2004, International Business Machines
3// Corporation and others. All Rights Reserved.
4// This code is licensed under the terms of the Eclipse Public License (EPL).
5
6#ifndef ClpDynamicMatrix_H
7#define ClpDynamicMatrix_H
8
9
10#include "CoinPragma.hpp"
11
12#include "ClpPackedMatrix.hpp"
13class ClpSimplex;
21
22public:
25 soloKey = 0x00,
26 inSmall = 0x01,
28 atLowerBound = 0x03
29 };
33 virtual void partialPricing(ClpSimplex * model, double start, double end,
34 int & bestSequence, int & numberWanted);
35
39 virtual int updatePivot(ClpSimplex * model, double oldInValue, double oldOutValue);
43 virtual double * rhsOffset(ClpSimplex * model, bool forceRefresh = false,
44 bool check = false);
45
50 virtual void times(double scalar,
51 const double * x, double * y) const;
53 void modifyOffset(int sequence, double amount);
55 double keyValue(int iSet) const;
64 virtual void dualExpanded(ClpSimplex * model, CoinIndexedVector * array,
65 double * other, int mode);
83 virtual int generalExpanded(ClpSimplex * model, int mode, int & number);
88 virtual int refresh(ClpSimplex * model);
92 virtual void createVariable(ClpSimplex * model, int & bestSequence);
94 virtual double reducedCost( ClpSimplex * model, int sequence) const;
96 void gubCrash();
98 void writeMps(const char * name);
102 int addColumn(int numberEntries, const int * row, const double * element,
103 double cost, double lower, double upper, int iSet,
104 DynamicStatus status);
109 virtual void packDown(const int * , int ) {}
111 inline double columnLower(int sequence) const {
112 if (columnLower_) return columnLower_[sequence];
113 else return 0.0;
114 }
116 inline double columnUpper(int sequence) const {
117 if (columnUpper_) return columnUpper_[sequence];
118 else return COIN_DBL_MAX;
119 }
120
122
123
124
136 int numberColumns, const int * starts,
137 const double * lower, const double * upper,
138 const CoinBigIndex * startColumn, const int * row,
139 const double * element, const double * cost,
140 const double * columnLower = NULL, const double * columnUpper = NULL,
141 const unsigned char * status = NULL,
142 const unsigned char * dynamicStatus = NULL);
143
147
153 ClpDynamicMatrix(const CoinPackedMatrix&);
154
157 virtual ClpMatrixBase * clone() const ;
159
162 inline ClpSimplex::Status getStatus(int sequence) const {
163 return static_cast<ClpSimplex::Status> (status_[sequence] & 7);
164 }
165 inline void setStatus(int sequence, ClpSimplex::Status status) {
166 unsigned char & st_byte = status_[sequence];
167 st_byte = static_cast<unsigned char>(st_byte & ~7);
168 st_byte = static_cast<unsigned char>(st_byte | status);
169 }
171 inline bool flaggedSlack(int i) const {
172 return (status_[i] & 8) != 0;
173 }
174 inline void setFlaggedSlack(int i) {
175 status_[i] = static_cast<unsigned char>(status_[i] | 8);
176 }
177 inline void unsetFlaggedSlack(int i) {
178 status_[i] = static_cast<unsigned char>(status_[i] & ~8);
179 }
181 inline int numberSets() const {
182 return numberSets_;
183 }
185 inline int numberGubEntries() const
186 { return startSet_[numberSets_];}
188 inline int * startSets() const
189 { return startSet_;}
191 inline bool flagged(int i) const {
192 return (dynamicStatus_[i] & 8) != 0;
193 }
194 inline void setFlagged(int i) {
195 dynamicStatus_[i] = static_cast<unsigned char>(dynamicStatus_[i] | 8);
196 }
197 inline void unsetFlagged(int i) {
198 dynamicStatus_[i] = static_cast<unsigned char>(dynamicStatus_[i] & ~8);
199 }
200 inline void setDynamicStatus(int sequence, DynamicStatus status) {
201 unsigned char & st_byte = dynamicStatus_[sequence];
202 st_byte = static_cast<unsigned char>(st_byte & ~7);
203 st_byte = static_cast<unsigned char>(st_byte | status);
204 }
205 inline DynamicStatus getDynamicStatus(int sequence) const {
206 return static_cast<DynamicStatus> (dynamicStatus_[sequence] & 7);
207 }
209 inline double objectiveOffset() const {
210 return objectiveOffset_;
211 }
213 inline CoinBigIndex * startColumn() const {
214 return startColumn_;
215 }
217 inline int * row() const {
218 return row_;
219 }
221 inline double * element() const {
222 return element_;
223 }
225 inline double * cost() const {
226 return cost_;
227 }
229 inline int * id() const {
230 return id_;
231 }
233 inline double * columnLower() const {
234 return columnLower_;
235 }
237 inline double * columnUpper() const {
238 return columnUpper_;
239 }
241 inline double * lowerSet() const {
242 return lowerSet_;
243 }
245 inline double * upperSet() const {
246 return upperSet_;
247 }
249 inline int numberGubColumns() const {
250 return numberGubColumns_;
251 }
253 inline int firstAvailable() const {
254 return firstAvailable_;
255 }
257 inline int firstDynamic() const {
258 return firstDynamic_;
259 }
261 inline int lastDynamic() const {
262 return lastDynamic_;
263 }
265 inline int numberStaticRows() const {
266 return numberStaticRows_;
267 }
269 inline int numberElements() const {
270 return numberElements_;
271 }
272 inline int * keyVariable() const {
273 return keyVariable_;
274 }
278 inline unsigned char * gubRowStatus() const {
279 return status_;
280 }
282 inline unsigned char * dynamicStatus() const {
283 return dynamicStatus_;
284 }
286 int whichSet (int sequence) const;
288
289
290protected:
309 mutable int * keyVariable_;
311 int * toIndex_;
312 // Reverse pointer from index to set
321 double * lowerSet_;
323 double * upperSet_;
325 unsigned char * status_;
361 int * next_;
363 CoinBigIndex * startColumn_;
365 int * row_;
367 double * element_;
369 double * cost_;
371 int * id_;
373 unsigned char * dynamicStatus_;
375 double * columnLower_;
377 double * columnUpper_;
379};
380
381#endif
This implements a dynamic matrix when we have a limit on the number of "interesting rows".
double * columnUpper() const
Optional upper bounds on columns.
int whichSet(int sequence) const
Returns which set a variable is in.
int * next_
next in chain
int * id_
ids of active columns (just index here)
virtual void times(double scalar, const double *x, double *y) const
Return y + A * scalar *x in y.
virtual double reducedCost(ClpSimplex *model, int sequence) const
Returns reduced cost of a variable.
virtual int refresh(ClpSimplex *model)
Purely for column generation and similar ideas.
double keyValue(int iSet) const
Gets key value when none in small.
unsigned char * gubRowStatus() const
Status region for gub slacks.
virtual double * rhsOffset(ClpSimplex *model, bool forceRefresh=false, bool check=false)
Returns effective RHS offset if it is being used.
double objectiveOffset() const
Saved value of objective offset.
ClpDynamicMatrix & operator=(const ClpDynamicMatrix &)
unsigned char * status_
Status of slack on set.
virtual void dualExpanded(ClpSimplex *model, CoinIndexedVector *array, double *other, int mode)
mode=0 - Set up before "updateTranspose" and "transposeTimes" for duals using extended updates array ...
double * lowerSet_
Lower bounds on sets.
CoinBigIndex * startColumn_
Starts of each column.
int firstDynamic() const
first dynamic
int numberGubEntries() const
Number of possible gub variables.
int savedBestSet_
Saved best set in pricing.
DynamicStatus
enums for status of various sorts
double infeasibilityWeight_
Infeasibility weight when last full pass done.
int numberSets_
Number of sets (dynamic rows)
double columnUpper(int sequence) const
Gets upper bound (to simplify coding)
int * row() const
rows
double columnLower(int sequence) const
Gets lower bound (to simplify coding)
int numberGubColumns() const
size
virtual void partialPricing(ClpSimplex *model, double start, double end, int &bestSequence, int &numberWanted)
Partial pricing.
void setFlaggedSlack(int i)
int * startSets() const
Sets.
int numberDualInfeasibilities_
Number of dual infeasibilities.
int numberPrimalInfeasibilities_
Number of primal infeasibilities.
void writeMps(const char *name)
Writes out model (without names)
ClpSimplex * model_
Pointer back to model.
ClpDynamicMatrix()
Default constructor.
double * columnLower() const
Optional lower bounds on columns.
double sumDualInfeasibilities_
Sum of dual infeasibilities.
double objectiveOffset_
Saved value of objective offset.
int numberActiveSets_
Number of active sets.
void unsetFlaggedSlack(int i)
double * columnLower_
Optional lower bounds on columns.
int numberElements_
size of working matrix (max)
void gubCrash()
Does gub crash.
unsigned char * dynamicStatus_
for status and which bound
void initialProblem()
Populates initial matrix from dynamic status.
void modifyOffset(int sequence, double amount)
Modifies rhs offset.
double * upperSet() const
Upper bounds on sets.
virtual int updatePivot(ClpSimplex *model, double oldInValue, double oldOutValue)
update information for a pivot (and effective rhs)
void unsetFlagged(int i)
double * columnUpper_
Optional upper bounds on columns.
double savedBestGubDual_
Saved best dual on gub row in pricing.
int maximumGubColumns_
current maximum number of columns (then compress)
int numberElements() const
size of working matrix (max)
int firstAvailable_
first free
bool flagged(int i) const
Whether flagged.
int firstDynamic_
first dynamic
int * id() const
ids of active columns (just index here)
int firstAvailable() const
first free
int addColumn(int numberEntries, const int *row, const double *element, double cost, double lower, double upper, int iSet, DynamicStatus status)
Adds in a column to gub structure (called from descendant) and returns sequence.
virtual void createVariable(ClpSimplex *model, int &bestSequence)
Creates a variable.
void setDynamicStatus(int sequence, DynamicStatus status)
double * cost() const
costs
int maximumElements_
current maximum number of elemnts (then compress)
int numberStaticRows() const
number of rows in original model
ClpDynamicMatrix(const ClpDynamicMatrix &)
The copy constructor.
DynamicStatus getDynamicStatus(int sequence) const
double sumOfRelaxedPrimalInfeasibilities_
Sum of Primal infeasibilities using tolerance based on error in primals.
double * lowerSet() const
Lower bounds on sets.
ClpDynamicMatrix(ClpSimplex *model, int numberSets, int numberColumns, const int *starts, const double *lower, const double *upper, const CoinBigIndex *startColumn, const int *row, const double *element, const double *cost, const double *columnLower=NULL, const double *columnUpper=NULL, const unsigned char *status=NULL, const unsigned char *dynamicStatus=NULL)
This is the real constructor.
int * toIndex_
Backward pointer to extra row.
int numberSets() const
Number of sets (dynamic rows)
unsigned char * dynamicStatus() const
Status region for gub variables.
double * element() const
elements
double sumOfRelaxedDualInfeasibilities_
Sum of Dual infeasibilities using tolerance based on error in duals.
int lastDynamic_
number of columns in dynamic model
void switchOffCheck()
Switches off dj checking each factorization (for BIG models)
int * keyVariable_
Key variable of set (only accurate if none in small problem)
double sumPrimalInfeasibilities_
Sum of primal infeasibilities.
bool flaggedSlack(int i) const
Whether flagged slack.
virtual ClpMatrixBase * clone() const
Clone.
ClpSimplex::Status getStatus(int sequence) const
Status of row slacks.
virtual int generalExpanded(ClpSimplex *model, int mode, int &number)
mode=0 - Create list of non-key basics in pivotVariable_ using number as numberBasic in and out mode=...
int * keyVariable() const
int firstAvailableBefore_
first free when iteration started
int noCheck_
If pricing will declare victory (i.e.
ClpDynamicMatrix(const CoinPackedMatrix &)
The copy constructor from an CoinPackedMatrix.
int numberStaticRows_
number of rows in original model
virtual ~ClpDynamicMatrix()
Destructor.
int * backToPivotRow_
Backward pointer to pivot row !!!
double * element_
elements
void setStatus(int sequence, ClpSimplex::Status status)
CoinBigIndex * startColumn() const
Starts of each column.
double * upperSet_
Upper bounds on sets.
int * startSet_
Start of each set.
int lastDynamic() const
number of columns in dynamic model
virtual void packDown(const int *, int)
If addColumn forces compression then this allows descendant to know what to do.
Abstract base class for Clp Matrices.
virtual void times(double scalar, const double *x, double *y) const
Return y + A * scalar *x in y.
This solves LPs using the simplex method.
Definition: ClpSimplex.hpp:70
Status
enums for status of various sorts.
Definition: ClpSimplex.hpp:78