Minotaur 0.4.1
Docs for developers
ProblemSize.h
Go to the documentation of this file.
1//
2// Minotaur -- It's only 1/2 bull
3//
4// (C)opyright 2009 - 2025 The Minotaur Team.
5//
6
14#ifndef MINOTAURPROBLEMSIZE_H
15#define MINOTAURPROBLEMSIZE_H
16
17#include "Types.h"
18
19namespace Minotaur
20{
23{
26
29
32
35
38
41
44
47
50
53
59
65
71
74
77
80
83
86
89
92
96
100
103
106
109
112
115
118
121
124
127
130
133
136
139
142
145
148
151
154
157
160
163
166
169
172
175
178 };
179 typedef ProblemSize * ProblemSizePtr;
180 typedef const ProblemSize * ConstProblemSizePtr;
181}
182
183#endif
184
Declare important 'types' used in Minotaur.
Definition: ActiveNodeStore.h:20
unsigned int UInt
Unsigned integer.
Definition: Types.h:30
FunctionType
Different types of functions in Minotaur.
Definition: Types.h:65
ProblemSize stores several statistics on the size of the Problem.
Definition: ProblemSize.h:23
UInt countInvariantKnapsack
Count the number of invariant knapsack type constraints.
Definition: ProblemSize.h:138
UInt countVariableBound
Count the number of variable bound type constraints.
Definition: ProblemSize.h:123
UInt countIntegerKnapsack
Count the number of integer knapsack type constraints.
Definition: ProblemSize.h:150
UInt bilinCons
Definition: ProblemSize.h:58
UInt multiLinTerms
Number of terms in the all multilinear functions in the constraints.
Definition: ProblemSize.h:102
UInt consWithBilin
Number of constraints that have a bilinear function.
Definition: ProblemSize.h:79
UInt objs
Number of objectives in the Problem.
Definition: ProblemSize.h:31
UInt consWithNonlin
Number of constraints that have a nonlinear function.
Definition: ProblemSize.h:88
UInt vars
Number of variables in the Problem.
Definition: ProblemSize.h:25
UInt countComplementSimpleBall
Count the number of simple ball complement constraint.
Definition: ProblemSize.h:168
UInt countSetPartitioning
Count the number of set partitioning type constraints.
Definition: ProblemSize.h:126
UInt countBinPacking
Count the number of bin packing type constraints.
Definition: ProblemSize.h:144
UInt countComplementEllipsoid
Count the number of ellipsoid complement constraint.
Definition: ProblemSize.h:171
UInt objLinTerms
Number of terms in linear function in the objectives.
Definition: ProblemSize.h:108
UInt countSetPacking
Count the number of set packing type constraints.
Definition: ProblemSize.h:129
UInt countCardinality
Count the number of cardinality type constraints.
Definition: ProblemSize.h:135
UInt countDiagQuad
Count the number of diagonal quadratic constraints.
Definition: ProblemSize.h:159
UInt conts
Number of continuous variables.
Definition: ProblemSize.h:43
UInt sqTerms
Definition: ProblemSize.h:99
UInt SOS1Cons
Number of SOS Type 1 constraints.
Definition: ProblemSize.h:49
UInt quadTerms
Number of terms in the all quadratic functions in the constraints.
Definition: ProblemSize.h:105
UInt bins
Number of binary variables.
Definition: ProblemSize.h:34
UInt countQuadConvertSOC
Count quadratic constraints convertible to SOC constraints.
Definition: ProblemSize.h:177
UInt fixed
Number of integer variables not including binary variables.
Definition: ProblemSize.h:37
UInt nonlinCons
Number of constraints that have nonlinear function.
Definition: ProblemSize.h:73
UInt consWithMultilin
Number of constraints that have a multilinear function.
Definition: ProblemSize.h:82
UInt multilinCons
Definition: ProblemSize.h:64
UInt countSetCovering
Count the number of set covering type constraints.
Definition: ProblemSize.h:132
UInt countMixedBinary
Count the number of mixed binary type constraints.
Definition: ProblemSize.h:153
UInt ints
Number of integer variables not including binary variables.
Definition: ProblemSize.h:40
UInt linCons
Number of constraints that have a linear function only.
Definition: ProblemSize.h:46
UInt objQuadTerms
Number of terms in quadratic function in the objectives.
Definition: ProblemSize.h:111
UInt countKnapsack
Count the number of knapsack type constraints.
Definition: ProblemSize.h:147
UInt consWithQuad
Number of constraints that have a quadratic function.
Definition: ProblemSize.h:85
UInt countNoSpecificStructure
Count the number of constraints with no specific structure.
Definition: ProblemSize.h:156
UInt countAggregation
Count the number of aggregation type constraints.
Definition: ProblemSize.h:117
UInt countSimpleBall
Count the number of simple ball constraints.
Definition: ProblemSize.h:162
FunctionType objType
Type of objective: constant, linear, quadratic ...
Definition: ProblemSize.h:114
UInt countPrecedence
Count the number of precedence type constraints.
Definition: ProblemSize.h:120
UInt quadCons
Definition: ProblemSize.h:70
UInt bilinTerms
Definition: ProblemSize.h:95
UInt countPureBilinear
Count the number of pure bilinear constraint.
Definition: ProblemSize.h:174
UInt linTerms
Number of terms in the all linear functions in the constraints.
Definition: ProblemSize.h:91
UInt countEllipsoid
Count the number of ellipsoid constraints.
Definition: ProblemSize.h:165
UInt SOS2Cons
Number of SOS Type 2 constraints.
Definition: ProblemSize.h:52
UInt consWithLin
Number of constraints that have a linear function.
Definition: ProblemSize.h:76
UInt cons
Number of constraints in the Problem.
Definition: ProblemSize.h:28
UInt countEquationKnapsack
Count the number of equation knapsack type constraints.
Definition: ProblemSize.h:141

Minotaur source code documented by Doxygen 1.9.4 on Thu Apr 24 2025