Uses of Class
com.google.ortools.sat.LinearObjective.Builder

Packages that use LinearObjective.Builder

Package	Description
com.google.ortools.sat

Uses of LinearObjective.Builder in com.google.ortools.sat

Methods in com.google.ortools.sat that return LinearObjective.Builder

Modifier and Type	Method and Description
LinearObjective.Builder	LinearObjective.Builder.addAllCoefficients(java.lang.Iterable<? extends java.lang.Long> values) repeated int64 coefficients = 2;
LinearObjective.Builder	LinearObjective.Builder.addAllLiterals(java.lang.Iterable<? extends java.lang.Integer> values) 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.
LinearObjective.Builder	LinearObjective.Builder.addCoefficients(long value) repeated int64 coefficients = 2;
LinearObjective.Builder	LinearObjective.Builder.addLiterals(int value) 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.
LinearObjective.Builder	LinearObjective.Builder.clear()
LinearObjective.Builder	LinearObjective.Builder.clearCoefficients() repeated int64 coefficients = 2;
LinearObjective.Builder	LinearObjective.Builder.clearLiterals() 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.
LinearObjective.Builder	LinearObjective.Builder.clearOffset() 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.
LinearObjective.Builder	LinearObjective.Builder.clearScalingFactor() optional double scaling_factor = 4 [default = 1];
LinearObjective.Builder	LinearBooleanProblem.Builder.getObjectiveBuilder() The objective of the problem.
LinearObjective.Builder	LinearObjective.Builder.mergeFrom(com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry)
LinearObjective.Builder	LinearObjective.Builder.mergeFrom(LinearObjective other)
LinearObjective.Builder	LinearObjective.Builder.mergeFrom(com.google.protobuf.Message other)
static LinearObjective.Builder	LinearObjective.newBuilder()
static LinearObjective.Builder	LinearObjective.newBuilder(LinearObjective prototype)
LinearObjective.Builder	LinearObjective.newBuilderForType()
protected LinearObjective.Builder	LinearObjective.newBuilderForType(com.google.protobuf.AbstractMessage.BuilderParent parent)
LinearObjective.Builder	LinearObjective.Builder.setCoefficients(int index, long value) repeated int64 coefficients = 2;
LinearObjective.Builder	LinearObjective.Builder.setLiterals(int index, int value) 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.
LinearObjective.Builder	LinearObjective.Builder.setOffset(double value) 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.
LinearObjective.Builder	LinearObjective.Builder.setScalingFactor(double value) optional double scaling_factor = 4 [default = 1];
LinearObjective.Builder	LinearObjective.toBuilder()

Methods in com.google.ortools.sat with parameters of type LinearObjective.Builder

Modifier and Type	Method and Description
LinearBooleanProblem.Builder	LinearBooleanProblem.Builder.setObjective(LinearObjective.Builder builderForValue) The objective of the problem.