Cgl 0.59.7

- 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
ClpSimplexNonlinear.hpp
Go to the documentation of this file.
1 /* $Id: ClpSimplexNonlinear.hpp 2025 2014-03-19 12:49:55Z forrest $ */
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 Authors
7
8 John Forrest
9
10 */
11 #ifndef ClpSimplexNonlinear_H
12 #define ClpSimplexNonlinear_H
13
14 class ClpNonlinearInfo;
15 class ClpQuadraticObjective;
16 class ClpConstraint;
17
18 #include "ClpSimplexPrimal.hpp"
19
28 class ClpSimplexNonlinear : public ClpSimplexPrimal {
29
30 public:
31
38 int primal();
44 int primalSLP(int numberPasses, double deltaTolerance,
45 int otherOptions=0);
47 int primalDualCuts(char * rowsIn, int startUp, int algorithm);
53 int primalSLP(int numberConstraints, ClpConstraint ** constraints,
54 int numberPasses, double deltaTolerance);
55
61 void directionVector (CoinIndexedVector * longArray,
62 CoinIndexedVector * spare1, CoinIndexedVector * spare2,
63 int mode,
64 double & normFlagged, double & normUnflagged,
65 int & numberNonBasic);
67 int whileIterating (int & pivotMode);
80 int pivotColumn(CoinIndexedVector * longArray,
81 CoinIndexedVector * rowArray,
82 CoinIndexedVector * columnArray,
83 CoinIndexedVector * spare,
84 int & pivotMode,
85 double & solutionError,
86 double * array1);
96 void statusOfProblemInPrimal(int & lastCleaned, int type,
97 ClpSimplexProgress * progress,
98 bool doFactorization,
99 double & bestObjectiveWhenFlagged);
112 int pivotNonlinearResult();
114
115 };
116 #endif
117
ClpSimplexNonlinear::pivotNonlinearResult
int pivotNonlinearResult()
Do last half of an iteration.
ClpSimplexNonlinear::statusOfProblemInPrimal
void statusOfProblemInPrimal(int &lastCleaned, int type, ClpSimplexProgress *progress, bool doFactorization, double &bestObjectiveWhenFlagged)
Refactorizes if necessary Checks if finished.
ClpSimplexNonlinear::directionVector
void directionVector(CoinIndexedVector *longArray, CoinIndexedVector *spare1, CoinIndexedVector *spare2, int mode, double &normFlagged, double &normUnflagged, int &numberNonBasic)
Creates direction vector.
ClpQuadraticObjective
Quadratic Objective Class.
Definition: ClpQuadraticObjective.hpp:18
ClpConstraint
Constraint Abstract Base Class.
Definition: ClpConstraint.hpp:19
ClpSimplexProgress
For saving extra information to see if looping.
Definition: ClpSolve.hpp:261
ClpSimplexNonlinear::primal
int primal()
Primal algorithms for reduced gradient At present we have two algorithms:
CoinIndexedVector
Indexed Vector.
Definition: CoinIndexedVector.hpp:104
ClpSimplex::algorithm
int algorithm() const
Current (or last) algorithm.
Definition: ClpSimplex.hpp:647
ClpSimplex::columnArray
CoinIndexedVector * columnArray(int index) const
Useful column length arrays (0,1,2,3,4,5)
Definition: ClpSimplex.hpp:731
ClpSimplexNonlinear::whileIterating
int whileIterating(int &pivotMode)
Main part.
ClpSimplex::progress
ClpSimplexProgress * progress()
For dealing with all issues of cycling etc.
Definition: ClpSimplex.hpp:1330
ClpSimplexNonlinear::primalSLP
int primalSLP(int numberPasses, double deltaTolerance, int otherOptions=0)
Primal algorithm for quadratic Using a semi-trust region approach as for pooling problem This is in b...
ClpSimplex::rowArray
CoinIndexedVector * rowArray(int index) const
Useful row length arrays (0,1,2,3,4,5)
Definition: ClpSimplex.hpp:727
ClpSimplexNonlinear::pivotColumn
int pivotColumn(CoinIndexedVector *longArray, CoinIndexedVector *rowArray, CoinIndexedVector *columnArray, CoinIndexedVector *spare, int &pivotMode, double &solutionError, double *array1)
longArray has direction pivotMode - 0 - use all dual infeasible variables 1 - largest dj while &gt;= 10 ...
ClpSimplexPrimal.hpp
ClpSimplexNonlinear::primalDualCuts
int primalDualCuts(char *rowsIn, int startUp, int algorithm)
May use a cut approach for solving any LP.
ClpSimplexPrimal
This solves LPs using the primal simplex method.
Definition: ClpSimplexPrimal.hpp:23
ClpSimplexNonlinear
This solves non-linear LPs using the primal simplex method.
Definition: ClpSimplexNonlinear.hpp:28