Uses of Class
com.google.ortools.sat.LinearObjective.Builder
Packages that use LinearObjective.Builder
-
Uses of LinearObjective.Builder in com.google.ortools.sat
Subclasses with type arguments of type LinearObjective.Builder in com.google.ortools.satModifier and TypeClassDescriptionstatic final classThe objective of an optimization problem.Methods in com.google.ortools.sat that return LinearObjective.BuilderModifier and TypeMethodDescriptionLinearObjective.Builder.addAllCoefficients(Iterable<? extends Long> values) repeated int64 coefficients = 2;LinearObjective.Builder.addAllLiterals(Iterable<? extends 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.addCoefficients(long value) repeated int64 coefficients = 2;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.clear()LinearObjective.Builder.clearCoefficients()repeated int64 coefficients = 2;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.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.clearScalingFactor()optional double scaling_factor = 4 [default = 1];LinearBooleanProblem.Builder.getObjectiveBuilder()The objective of the problem.LinearObjective.Builder.mergeFrom(LinearObjective other) LinearObjective.Builder.mergeFrom(com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) LinearObjective.Builder.mergeFrom(com.google.protobuf.Message other) static LinearObjective.BuilderLinearObjective.newBuilder()static LinearObjective.BuilderLinearObjective.newBuilder(LinearObjective prototype) LinearObjective.newBuilderForType()protected LinearObjective.BuilderLinearObjective.newBuilderForType(com.google.protobuf.AbstractMessage.BuilderParent parent) LinearObjective.Builder.setCoefficients(int index, long value) repeated int64 coefficients = 2;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.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.setScalingFactor(double value) optional double scaling_factor = 4 [default = 1];LinearObjective.toBuilder()Methods in com.google.ortools.sat with parameters of type LinearObjective.BuilderModifier and TypeMethodDescriptionLinearBooleanProblem.Builder.setObjective(LinearObjective.Builder builderForValue) The objective of the problem.