com.google.ortools.linearsolver.MPConstraintProtoOrBuilder Maven / Gradle / Ivy
The newest version!
// Generated by the protocol buffer compiler. DO NOT EDIT!
// source: ortools/linear_solver/linear_solver.proto
package com.google.ortools.linearsolver;
public interface MPConstraintProtoOrBuilder extends
// @@protoc_insertion_point(interface_extends:operations_research.MPConstraintProto)
com.google.protobuf.MessageOrBuilder {
/**
*
* 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];
* @return A list containing the varIndex.
*/
java.util.List 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];
* @return The count of varIndex.
*/
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];
* @param index The index of the element to return.
* @return The varIndex at the given index.
*/
int getVarIndex(int index);
/**
*
* Must be finite.
*
*
* repeated double coefficient = 7 [packed = true];
* @return A list containing the coefficient.
*/
java.util.List getCoefficientList();
/**
*
* Must be finite.
*
*
* repeated double coefficient = 7 [packed = true];
* @return The count of coefficient.
*/
int getCoefficientCount();
/**
*
* Must be finite.
*
*
* repeated double coefficient = 7 [packed = true];
* @param index The index of the element to return.
* @return The coefficient at the given index.
*/
double getCoefficient(int index);
/**
*
* lower_bound must be <= upper_bound.
*
*
* optional double lower_bound = 2 [default = -inf];
* @return Whether the lowerBound field is set.
*/
boolean hasLowerBound();
/**
*
* lower_bound must be <= upper_bound.
*
*
* optional double lower_bound = 2 [default = -inf];
* @return The lowerBound.
*/
double getLowerBound();
/**
* optional double upper_bound = 3 [default = inf];
* @return Whether the upperBound field is set.
*/
boolean hasUpperBound();
/**
* optional double upper_bound = 3 [default = inf];
* @return The upperBound.
*/
double getUpperBound();
/**
*
* The name of the constraint.
*
*
* optional string name = 4 [default = ""];
* @return Whether the name field is set.
*/
boolean hasName();
/**
*
* The name of the constraint.
*
*
* optional string name = 4 [default = ""];
* @return The name.
*/
java.lang.String getName();
/**
*
* The name of the constraint.
*
*
* optional string name = 4 [default = ""];
* @return The bytes for name.
*/
com.google.protobuf.ByteString
getNameBytes();
/**
*
* [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];
* @return Whether the isLazy field is set.
*/
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];
* @return The isLazy.
*/
boolean getIsLazy();
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy