Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
Public Member Functions | |
java.util.List< java.lang.Integer > | getVarIndexList () |
int | getVarIndexCount () |
int | getVarIndex (int index) |
java.util.List< java.lang.Double > | getCoefficientList () |
int | getCoefficientCount () |
double | getCoefficient (int index) |
boolean | hasLowerBound () |
double | getLowerBound () |
boolean | hasUpperBound () |
double | getUpperBound () |
boolean | hasName () |
java.lang.String | getName () |
com.google.protobuf.ByteString | getNameBytes () |
boolean | hasIsLazy () |
boolean | getIsLazy () |
Definition at line 7 of file MPConstraintProtoOrBuilder.java.
double com.google.ortools.linearsolver.MPConstraintProtoOrBuilder.getCoefficient | ( | int | index | ) |
Must be finite.
repeated double coefficient = 7 [packed = true];
index | The index of the element to return. |
Implemented in com.google.ortools.linearsolver.MPConstraintProto.Builder, and com.google.ortools.linearsolver.MPConstraintProto.
int com.google.ortools.linearsolver.MPConstraintProtoOrBuilder.getCoefficientCount | ( | ) |
Must be finite.
repeated double coefficient = 7 [packed = true];
Implemented in com.google.ortools.linearsolver.MPConstraintProto.Builder, and com.google.ortools.linearsolver.MPConstraintProto.
java.util.List< java.lang.Double > com.google.ortools.linearsolver.MPConstraintProtoOrBuilder.getCoefficientList | ( | ) |
Must be finite.
repeated double coefficient = 7 [packed = true];
Implemented in com.google.ortools.linearsolver.MPConstraintProto.Builder, and com.google.ortools.linearsolver.MPConstraintProto.
boolean com.google.ortools.linearsolver.MPConstraintProtoOrBuilder.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];
Implemented in com.google.ortools.linearsolver.MPConstraintProto.Builder, and com.google.ortools.linearsolver.MPConstraintProto.
double com.google.ortools.linearsolver.MPConstraintProtoOrBuilder.getLowerBound | ( | ) |
lower_bound must be <= upper_bound.
optional double lower_bound = 2 [default = -inf];
Implemented in com.google.ortools.linearsolver.MPConstraintProto.Builder, and com.google.ortools.linearsolver.MPConstraintProto.
java.lang.String com.google.ortools.linearsolver.MPConstraintProtoOrBuilder.getName | ( | ) |
The name of the constraint.
optional string name = 4 [default = ""];
Implemented in com.google.ortools.linearsolver.MPConstraintProto.Builder, and com.google.ortools.linearsolver.MPConstraintProto.
com.google.protobuf.ByteString com.google.ortools.linearsolver.MPConstraintProtoOrBuilder.getNameBytes | ( | ) |
The name of the constraint.
optional string name = 4 [default = ""];
Implemented in com.google.ortools.linearsolver.MPConstraintProto.Builder, and com.google.ortools.linearsolver.MPConstraintProto.
double com.google.ortools.linearsolver.MPConstraintProtoOrBuilder.getUpperBound | ( | ) |
optional double upper_bound = 3 [default = inf];
Implemented in com.google.ortools.linearsolver.MPConstraintProto.Builder, and com.google.ortools.linearsolver.MPConstraintProto.
int com.google.ortools.linearsolver.MPConstraintProtoOrBuilder.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. |
Implemented in com.google.ortools.linearsolver.MPConstraintProto.Builder, and com.google.ortools.linearsolver.MPConstraintProto.
int com.google.ortools.linearsolver.MPConstraintProtoOrBuilder.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];
Implemented in com.google.ortools.linearsolver.MPConstraintProto.Builder, and com.google.ortools.linearsolver.MPConstraintProto.
java.util.List< java.lang.Integer > com.google.ortools.linearsolver.MPConstraintProtoOrBuilder.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];
Implemented in com.google.ortools.linearsolver.MPConstraintProto.Builder, and com.google.ortools.linearsolver.MPConstraintProto.
boolean com.google.ortools.linearsolver.MPConstraintProtoOrBuilder.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];
Implemented in com.google.ortools.linearsolver.MPConstraintProto.Builder, and com.google.ortools.linearsolver.MPConstraintProto.
boolean com.google.ortools.linearsolver.MPConstraintProtoOrBuilder.hasLowerBound | ( | ) |
lower_bound must be <= upper_bound.
optional double lower_bound = 2 [default = -inf];
Implemented in com.google.ortools.linearsolver.MPConstraintProto.Builder, and com.google.ortools.linearsolver.MPConstraintProto.
boolean com.google.ortools.linearsolver.MPConstraintProtoOrBuilder.hasName | ( | ) |
The name of the constraint.
optional string name = 4 [default = ""];
Implemented in com.google.ortools.linearsolver.MPConstraintProto.Builder, and com.google.ortools.linearsolver.MPConstraintProto.
boolean com.google.ortools.linearsolver.MPConstraintProtoOrBuilder.hasUpperBound | ( | ) |
optional double upper_bound = 3 [default = inf];
Implemented in com.google.ortools.linearsolver.MPConstraintProto.Builder, and com.google.ortools.linearsolver.MPConstraintProto.