public interface MPSosConstraintOrBuilder
extends com.google.protobuf.MessageOrBuilder
| Modifier and Type | Method and Description |
|---|---|
MPSosConstraint.Type |
getType()
optional .operations_research.MPSosConstraint.Type type = 1 [default = SOS1_DEFAULT]; |
int |
getVarIndex(int index)
Variable index (w.r.t.
|
int |
getVarIndexCount()
Variable index (w.r.t.
|
java.util.List<java.lang.Integer> |
getVarIndexList()
Variable index (w.r.t.
|
double |
getWeight(int index)
Optional: SOS weights.
|
int |
getWeightCount()
Optional: SOS weights.
|
java.util.List<java.lang.Double> |
getWeightList()
Optional: SOS weights.
|
boolean |
hasType()
optional .operations_research.MPSosConstraint.Type type = 1 [default = SOS1_DEFAULT]; |
findInitializationErrors, getAllFields, getDefaultInstanceForType, getDescriptorForType, getField, getInitializationErrorString, getOneofFieldDescriptor, getRepeatedField, getRepeatedFieldCount, getUnknownFields, hasField, hasOneofboolean hasType()
optional .operations_research.MPSosConstraint.Type type = 1 [default = SOS1_DEFAULT];MPSosConstraint.Type getType()
optional .operations_research.MPSosConstraint.Type type = 1 [default = SOS1_DEFAULT];java.util.List<java.lang.Integer> getVarIndexList()
Variable index (w.r.t. the "variable" field of MPModelProto) of the variables in the SOS.
repeated int32 var_index = 2;int getVarIndexCount()
Variable index (w.r.t. the "variable" field of MPModelProto) of the variables in the SOS.
repeated int32 var_index = 2;int getVarIndex(int index)
Variable index (w.r.t. the "variable" field of MPModelProto) of the variables in the SOS.
repeated int32 var_index = 2;index - The index of the element to return.java.util.List<java.lang.Double> getWeightList()
Optional: SOS weights. If non-empty, must be of the same size as "var_index", and strictly increasing. If empty and required by the underlying solver, the 1..n sequence will be given as weights. SUBTLE: The weights can help the solver make branch-and-bound decisions that fit the underlying optimization model: after each LP relaxation, it will compute the "average weight" of the SOS variables, weighted by value (this is confusing: here we're using the values as weights), and the binary branch decision will be: is the non-zero variable above or below that? (weights are strictly monotonous, so the "cutoff" average weight corresponds to a "cutoff" index in the var_index sequence).
repeated double weight = 3;int getWeightCount()
Optional: SOS weights. If non-empty, must be of the same size as "var_index", and strictly increasing. If empty and required by the underlying solver, the 1..n sequence will be given as weights. SUBTLE: The weights can help the solver make branch-and-bound decisions that fit the underlying optimization model: after each LP relaxation, it will compute the "average weight" of the SOS variables, weighted by value (this is confusing: here we're using the values as weights), and the binary branch decision will be: is the non-zero variable above or below that? (weights are strictly monotonous, so the "cutoff" average weight corresponds to a "cutoff" index in the var_index sequence).
repeated double weight = 3;double getWeight(int index)
Optional: SOS weights. If non-empty, must be of the same size as "var_index", and strictly increasing. If empty and required by the underlying solver, the 1..n sequence will be given as weights. SUBTLE: The weights can help the solver make branch-and-bound decisions that fit the underlying optimization model: after each LP relaxation, it will compute the "average weight" of the SOS variables, weighted by value (this is confusing: here we're using the values as weights), and the binary branch decision will be: is the non-zero variable above or below that? (weights are strictly monotonous, so the "cutoff" average weight corresponds to a "cutoff" index in the var_index sequence).
repeated double weight = 3;index - The index of the element to return.Copyright © 2024. All rights reserved.