The objective of an optimization problem.
More...
|
static pb::MessageParser< LinearObjective > | Parser [get] |
|
static pbr::MessageDescriptor | Descriptor [get] |
|
pbc::RepeatedField< int > | Literals [get] |
| The goal is always to minimize the linear Boolean formula defined by these two fields: sum_i literal_i * coefficient_i where literal_i is 1 iff literal_i is true in a given assignment.
|
|
pbc::RepeatedField< long > | Coefficients [get] |
|
double | Offset [get, set] |
| For a given variable assignment, the "real" problem objective value is 'scaling_factor * (minimization_objective + offset)' where 'minimization_objective is the one defined just above.
|
|
bool | HasOffset [get] |
| Gets whether the "offset" field is set.
|
|
double | ScalingFactor [get, set] |
|
bool | HasScalingFactor [get] |
| Gets whether the "scaling_factor" field is set.
|
|
The objective of an optimization problem.
Definition at line 453 of file BooleanProblem.pb.cs.
◆ LinearObjective() [1/2]
Google.OrTools.Sat.LinearObjective.LinearObjective |
( |
| ) |
|
|
inline |
◆ LinearObjective() [2/2]
Google.OrTools.Sat.LinearObjective.LinearObjective |
( |
LinearObjective | other | ) |
|
|
inline |
◆ CalculateSize()
int Google.OrTools.Sat.LinearObjective.CalculateSize |
( |
| ) |
|
|
inline |
◆ ClearOffset()
void Google.OrTools.Sat.LinearObjective.ClearOffset |
( |
| ) |
|
|
inline |
◆ ClearScalingFactor()
void Google.OrTools.Sat.LinearObjective.ClearScalingFactor |
( |
| ) |
|
|
inline |
◆ Clone()
◆ Equals() [1/2]
◆ Equals() [2/2]
override bool Google.OrTools.Sat.LinearObjective.Equals |
( |
object | other | ) |
|
|
inline |
◆ GetHashCode()
override int Google.OrTools.Sat.LinearObjective.GetHashCode |
( |
| ) |
|
|
inline |
◆ MergeFrom() [1/2]
◆ MergeFrom() [2/2]
void Google.OrTools.Sat.LinearObjective.MergeFrom |
( |
pb.CodedInputStream | input | ) |
|
|
inline |
◆ ToString()
override string Google.OrTools.Sat.LinearObjective.ToString |
( |
| ) |
|
|
inline |
◆ WriteTo()
void Google.OrTools.Sat.LinearObjective.WriteTo |
( |
pb.CodedOutputStream | output | ) |
|
|
inline |
◆ CoefficientsFieldNumber
const int Google.OrTools.Sat.LinearObjective.CoefficientsFieldNumber = 2 |
|
static |
◆ LiteralsFieldNumber
const int Google.OrTools.Sat.LinearObjective.LiteralsFieldNumber = 1 |
|
static |
◆ OffsetFieldNumber
const int Google.OrTools.Sat.LinearObjective.OffsetFieldNumber = 3 |
|
static |
◆ ScalingFactorFieldNumber
const int Google.OrTools.Sat.LinearObjective.ScalingFactorFieldNumber = 4 |
|
static |
◆ Coefficients
pbc.RepeatedField<long> Google.OrTools.Sat.LinearObjective.Coefficients |
|
get |
◆ Descriptor
pbr.MessageDescriptor Google.OrTools.Sat.LinearObjective.Descriptor |
|
staticget |
◆ HasOffset
bool Google.OrTools.Sat.LinearObjective.HasOffset |
|
get |
◆ HasScalingFactor
bool Google.OrTools.Sat.LinearObjective.HasScalingFactor |
|
get |
◆ Literals
pbc.RepeatedField<int> Google.OrTools.Sat.LinearObjective.Literals |
|
get |
The goal is always to minimize the linear Boolean formula defined by these two fields: sum_i literal_i * coefficient_i where literal_i is 1 iff literal_i is true in a given assignment.
- Note
- the same variable shouldn't appear twice and that zero coefficients are not allowed.
Definition at line 518 of file BooleanProblem.pb.cs.
◆ Offset
double Google.OrTools.Sat.LinearObjective.Offset |
|
getset |
For a given variable assignment, the "real" problem objective value is 'scaling_factor * (minimization_objective + offset)' where 'minimization_objective is the one defined just above.
- Note
- this is not what we minimize, but it is what we display. In particular if scaling_factor is negative, then the "real" problem is a maximization problem, even if the "internal" objective is minimized.
Definition at line 550 of file BooleanProblem.pb.cs.
◆ Parser
pb.MessageParser<LinearObjective> Google.OrTools.Sat.LinearObjective.Parser |
|
staticget |
◆ ScalingFactor
double Google.OrTools.Sat.LinearObjective.ScalingFactor |
|
getset |
The documentation for this class was generated from the following file: