Cgl 0.60.2

- Main Page
- Related Pages
- Modules
- Namespaces
- Classes
- Files

- File List
- File Members

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
AbcSimplexPrimal.hpp
Go to the documentation of this file.
1 /* $Id: AbcSimplexPrimal.hpp 2385 2019-01-06 19:43:06Z unxusr $ */
2 // Copyright (C) 2002, International Business Machines
3 // Corporation and others, Copyright (C) 2012, FasterCoin. All Rights Reserved.
4 // This code is licensed under the terms of the Eclipse Public License (EPL).
5 /*
6 Authors
7
8 John Forrest
9
10 */
11 #ifndef AbcSimplexPrimal_H
12 #define AbcSimplexPrimal_H
13
14 #include "AbcSimplex.hpp"
15
23 class AbcSimplexPrimal : public AbcSimplex {
24
25 public:
114 int primal(int ifValuesPass = 0, int startFinishOptions = 0);
116
119 void alwaysOptimal(bool onOff);
121 bool alwaysOptimal() const;
126 void exactOutgoing(bool onOff);
127 bool exactOutgoing() const;
129
144 int whileIterating(int valuesOption);
145
164 int pivotResult(int ifValuesPass = 0);
165 int pivotResult4(int ifValuesPass = 0);
166
171 int updatePrimalsInPrimal(CoinIndexedVector *rowArray,
172 double theta,
173 double &objectiveChange,
174 int valuesPass);
178 void updatePrimalsInPrimal(CoinIndexedVector &rowArray,
179 double theta, bool valuesPass);
182 void createUpdateDuals(CoinIndexedVector &rowArray,
183 const double *originalCost,
184 const double extraCost[4],
185 double &objectiveChange,
186 int valuesPass);
189 double updateMinorCandidate(const CoinIndexedVector &updateBy,
190 CoinIndexedVector &candidate,
191 int sequenceIn);
193 void updatePartialUpdate(CoinIndexedVector &partialUpdate);
195 int doFTUpdate(CoinIndexedVector *vector[4]);
204 void primalRow(CoinIndexedVector *rowArray,
205 CoinIndexedVector *rhsArray,
206 CoinIndexedVector *spareArray,
207 int valuesPass);
208 typedef struct {
209 double theta_;
210 double alpha_;
211 double saveDualIn_;
212 double dualIn_;
213 double lowerIn_;
214 double upperIn_;
215 double valueIn_;
216 int sequenceIn_;
217 int directionIn_;
218 double dualOut_;
219 double lowerOut_;
220 double upperOut_;
221 double valueOut_;
222 int sequenceOut_;
223 int directionOut_;
224 int pivotRow_;
225 int valuesPass_;
226 } pivotStruct;
227 void primalRow(CoinIndexedVector *rowArray,
228 CoinIndexedVector *rhsArray,
229 CoinIndexedVector *spareArray,
230 pivotStruct &stuff);
238 void primalColumn(CoinPartitionedVector *updateArray,
239 CoinPartitionedVector *spareRow2,
240 CoinPartitionedVector *spareColumn1);
241
244 int checkUnbounded(CoinIndexedVector *ray, CoinIndexedVector *spare,
245 double changeCost);
255 void statusOfProblemInPrimal(int type);
257 void perturb(int type);
259 bool unPerturb();
261 int unflag();
267 int nextSuperBasic(int superBasicType, CoinIndexedVector *columnArray);
268
270 void primalRay(CoinIndexedVector *rowArray);
272 void clearAll();
273
275 int lexSolve();
276
278 };
279 #endif
280
281 /* vi: softtabstop=2 shiftwidth=2 expandtab tabstop=2
282 */
ClpModel::ray
double * ray() const
For advanced users - no need to delete - sign not changed.
Definition: ClpModel.hpp:859
AbcSimplexPrimal::checkUnbounded
int checkUnbounded(CoinIndexedVector *ray, CoinIndexedVector *spare, double changeCost)
Checks if tentative optimal actually means unbounded in primal Returns -3 if not, 2 if is unbounded...
AbcSimplexPrimal::pivotStruct::valueOut_
double valueOut_
Definition: AbcSimplexPrimal.hpp:221
AbcSimplexPrimal::pivotStruct::dualOut_
double dualOut_
Definition: AbcSimplexPrimal.hpp:218
AbcSimplexPrimal::unPerturb
bool unPerturb()
Take off effect of perturbation and say whether to try dual.
AbcSimplexPrimal::pivotStruct::valueIn_
double valueIn_
Definition: AbcSimplexPrimal.hpp:215
AbcSimplex
Definition: AbcSimplex.hpp:62
ClpSimplex::theta
double theta() const
Theta (pivot change)
Definition: ClpSimplex.hpp:1365
AbcSimplexPrimal::pivotStruct::saveDualIn_
double saveDualIn_
Definition: AbcSimplexPrimal.hpp:211
AbcSimplexPrimal::lexSolve
int lexSolve()
Sort of lexicographic resolve.
AbcSimplexPrimal::alwaysOptimal
bool alwaysOptimal() const
AbcSimplexPrimal::primalColumn
void primalColumn(CoinPartitionedVector *updateArray, CoinPartitionedVector *spareRow2, CoinPartitionedVector *spareColumn1)
Chooses primal pivot column updateArray has cost updates (also use pivotRow_ from last iteration) Wou...
AbcSimplexPrimal::unflag
int unflag()
Unflag all variables and return number unflagged.
AbcSimplexPrimal::updateMinorCandidate
double updateMinorCandidate(const CoinIndexedVector &updateBy, CoinIndexedVector &candidate, int sequenceIn)
Update minor candidate vector - new reduced cost returned later try and get change in reduced cost (t...
AbcSimplexPrimal::createUpdateDuals
void createUpdateDuals(CoinIndexedVector &rowArray, const double *originalCost, const double extraCost[4], double &objectiveChange, int valuesPass)
After rowArray will have cost changes for use next iteration.
AbcSimplexPrimal::primalRow
void primalRow(CoinIndexedVector *rowArray, CoinIndexedVector *rhsArray, CoinIndexedVector *spareArray, int valuesPass)
Row array has pivot column This chooses pivot row.
AbcSimplexPrimal::pivotStruct::alpha_
double alpha_
Definition: AbcSimplexPrimal.hpp:210
AbcSimplexPrimal::pivotStruct::directionIn_
int directionIn_
Definition: AbcSimplexPrimal.hpp:217
AbcSimplexPrimal::statusOfProblemInPrimal
void statusOfProblemInPrimal(int type)
Refactorizes if necessary Checks if finished.
AbcSimplex::sequenceIn
int sequenceIn() const
Return sequence In or Out.
Definition: AbcSimplex.hpp:693
AbcSimplex.hpp
AbcSimplexPrimal::pivotStruct::theta_
double theta_
Definition: AbcSimplexPrimal.hpp:209
AbcSimplexPrimal::primalRay
void primalRay(CoinIndexedVector *rowArray)
Create primal ray.
AbcSimplexPrimal::pivotStruct::sequenceOut_
int sequenceOut_
Definition: AbcSimplexPrimal.hpp:222
AbcSimplexPrimal::pivotStruct
Definition: AbcSimplexPrimal.hpp:208
AbcSimplexPrimal::updatePartialUpdate
void updatePartialUpdate(CoinIndexedVector &partialUpdate)
Update partial Ftran by R update.
AbcSimplexPrimal::exactOutgoing
bool exactOutgoing() const
AbcSimplexPrimal::pivotStruct::directionOut_
int directionOut_
Definition: AbcSimplexPrimal.hpp:223
CoinPartitionedVector
Definition: CoinIndexedVector.hpp:1303
AbcSimplexPrimal::perturb
void perturb(int type)
Perturbs problem (method depends on perturbation())
AbcSimplexPrimal::pivotStruct::upperIn_
double upperIn_
Definition: AbcSimplexPrimal.hpp:214
AbcSimplexPrimal::pivotStruct::valuesPass_
int valuesPass_
Definition: AbcSimplexPrimal.hpp:225
CoinIndexedVector
Indexed Vector.
Definition: CoinIndexedVector.hpp:104
AbcSimplexPrimal::pivotStruct::lowerOut_
double lowerOut_
Definition: AbcSimplexPrimal.hpp:219
AbcSimplexPrimal::pivotStruct::pivotRow_
int pivotRow_
Definition: AbcSimplexPrimal.hpp:224
ClpSimplex::columnArray
CoinIndexedVector * columnArray(int index) const
Useful column length arrays (0,1,2,3,4,5)
Definition: ClpSimplex.hpp:820
AbcSimplexPrimal::pivotStruct::dualIn_
double dualIn_
Definition: AbcSimplexPrimal.hpp:212
AbcSimplexPrimal::primal
int primal(int ifValuesPass=0, int startFinishOptions=0)
Primal algorithm.
AbcSimplexPrimal::nextSuperBasic
int nextSuperBasic(int superBasicType, CoinIndexedVector *columnArray)
Get next superbasic -1 if none, Normal type is 1 If type is 3 then initializes sorted list if 2 uses ...
AbcSimplexPrimal::doFTUpdate
int doFTUpdate(CoinIndexedVector *vector[4])
Do FT update as separate function for minor iterations (nonzero return code on problems) ...
AbcSimplexPrimal::updatePrimalsInPrimal
int updatePrimalsInPrimal(CoinIndexedVector *rowArray, double theta, double &objectiveChange, int valuesPass)
The primals are updated by the given array.
AbcSimplexPrimal::pivotStruct::sequenceIn_
int sequenceIn_
Definition: AbcSimplexPrimal.hpp:216
AbcSimplexPrimal::pivotStruct::upperOut_
double upperOut_
Definition: AbcSimplexPrimal.hpp:220
AbcSimplexPrimal::clearAll
void clearAll()
Clears all bits and clears rowArray[1] etc.
AbcSimplexPrimal::whileIterating
int whileIterating(int valuesOption)
This has the flow between re-factorizations.
AbcSimplexPrimal::pivotStruct::lowerIn_
double lowerIn_
Definition: AbcSimplexPrimal.hpp:213
ClpSimplex::rowArray
CoinIndexedVector * rowArray(int index) const
Useful row length arrays (0,1,2,3,4,5)
Definition: ClpSimplex.hpp:815
AbcSimplexPrimal::pivotResult
int pivotResult(int ifValuesPass=0)
Do last half of an iteration.
AbcSimplexPrimal::pivotResult4
int pivotResult4(int ifValuesPass=0)
AbcSimplexPrimal
This solves LPs using the primal simplex method.
Definition: AbcSimplexPrimal.hpp:23