public interface MPConstraintProtoOrBuilder
extends com.google.protobuf.MessageOrBuilder
Modifier and Type | Method and Description |
---|---|
double |
getCoefficient(int index)
Must be finite.
|
int |
getCoefficientCount()
Must be finite.
|
java.util.List<java.lang.Double> |
getCoefficientList()
Must be finite.
|
boolean |
getIsLazy()
[Advanced usage: do not use this if you don't know what you're doing.]
|
double |
getLowerBound()
lower_bound must be <= upper_bound.
|
java.lang.String |
getName()
The name of the constraint.
|
com.google.protobuf.ByteString |
getNameBytes()
The name of the constraint.
|
double |
getUpperBound()
optional double upper_bound = 3 [default = inf]; |
int |
getVarIndex(int index)
var_index[i] is the variable index (w.r.t. to "variable" field of
MPModelProto) of the i-th linear term involved in this constraint, and
coefficient[i] is its coefficient.
|
int |
getVarIndexCount()
var_index[i] is the variable index (w.r.t. to "variable" field of
MPModelProto) of the i-th linear term involved in this constraint, and
coefficient[i] is its coefficient.
|
java.util.List<java.lang.Integer> |
getVarIndexList()
var_index[i] is the variable index (w.r.t. to "variable" field of
MPModelProto) of the i-th linear term involved in this constraint, and
coefficient[i] is its coefficient.
|
boolean |
hasIsLazy()
[Advanced usage: do not use this if you don't know what you're doing.]
|
boolean |
hasLowerBound()
lower_bound must be <= upper_bound.
|
boolean |
hasName()
The name of the constraint.
|
boolean |
hasUpperBound()
optional double upper_bound = 3 [default = inf]; |
findInitializationErrors, getAllFields, getDefaultInstanceForType, getDescriptorForType, getField, getInitializationErrorString, getOneofFieldDescriptor, getRepeatedField, getRepeatedFieldCount, getUnknownFields, hasField, hasOneof
java.util.List<java.lang.Integer> getVarIndexList()
var_index[i] is the variable index (w.r.t. to "variable" field of MPModelProto) of the i-th linear term involved in this constraint, and coefficient[i] is its coefficient. Only the terms with non-zero coefficients need to appear. var_index may not contain duplicates.
repeated int32 var_index = 6 [packed = true];
int getVarIndexCount()
var_index[i] is the variable index (w.r.t. to "variable" field of MPModelProto) of the i-th linear term involved in this constraint, and coefficient[i] is its coefficient. Only the terms with non-zero coefficients need to appear. var_index may not contain duplicates.
repeated int32 var_index = 6 [packed = true];
int getVarIndex(int index)
var_index[i] is the variable index (w.r.t. to "variable" field of MPModelProto) of the i-th linear term involved in this constraint, and coefficient[i] is its coefficient. Only the terms with non-zero coefficients need to appear. var_index may not contain duplicates.
repeated int32 var_index = 6 [packed = true];
index
- The index of the element to return.java.util.List<java.lang.Double> getCoefficientList()
Must be finite.
repeated double coefficient = 7 [packed = true];
int getCoefficientCount()
Must be finite.
repeated double coefficient = 7 [packed = true];
double getCoefficient(int index)
Must be finite.
repeated double coefficient = 7 [packed = true];
index
- The index of the element to return.boolean hasLowerBound()
lower_bound must be <= upper_bound.
optional double lower_bound = 2 [default = -inf];
double getLowerBound()
lower_bound must be <= upper_bound.
optional double lower_bound = 2 [default = -inf];
boolean hasUpperBound()
optional double upper_bound = 3 [default = inf];
double getUpperBound()
optional double upper_bound = 3 [default = inf];
boolean hasName()
The name of the constraint.
optional string name = 4 [default = ""];
java.lang.String getName()
The name of the constraint.
optional string name = 4 [default = ""];
com.google.protobuf.ByteString getNameBytes()
The name of the constraint.
optional string name = 4 [default = ""];
boolean hasIsLazy()
[Advanced usage: do not use this if you don't know what you're doing.] A lazy constraint is handled differently by the core solving engine, but it does not change the result. It may or may not impact the performance. For more info see: http://tinyurl.com/lazy-constraints.
optional bool is_lazy = 5 [default = false];
boolean getIsLazy()
[Advanced usage: do not use this if you don't know what you're doing.] A lazy constraint is handled differently by the core solving engine, but it does not change the result. It may or may not impact the performance. For more info see: http://tinyurl.com/lazy-constraints.
optional bool is_lazy = 5 [default = false];
Copyright © 2025. All rights reserved.