com.google.ortools.sat.LinearBooleanProblemOrBuilder Interface Reference

Inheritance diagram for com.google.ortools.sat.LinearBooleanProblemOrBuilder:

Public Member Functions
boolean	hasName ()
java.lang.String	getName ()
com.google.protobuf.ByteString	getNameBytes ()
boolean	hasNumVariables ()
int	getNumVariables ()
java.util.List< com.google.ortools.sat.LinearBooleanConstraint >	getConstraintsList ()
com.google.ortools.sat.LinearBooleanConstraint	getConstraints (int index)
int	getConstraintsCount ()
java.util.List<? extends com.google.ortools.sat.LinearBooleanConstraintOrBuilder >	getConstraintsOrBuilderList ()
com.google.ortools.sat.LinearBooleanConstraintOrBuilder	getConstraintsOrBuilder (int index)
boolean	hasObjective ()
com.google.ortools.sat.LinearObjective	getObjective ()
com.google.ortools.sat.LinearObjectiveOrBuilder	getObjectiveOrBuilder ()
java.util.List< java.lang.String >	getVarNamesList ()
int	getVarNamesCount ()
java.lang.String	getVarNames (int index)
com.google.protobuf.ByteString	getVarNamesBytes (int index)
boolean	hasAssignment ()
com.google.ortools.sat.BooleanAssignment	getAssignment ()
com.google.ortools.sat.BooleanAssignmentOrBuilder	getAssignmentOrBuilder ()
boolean	hasOriginalNumVariables ()
int	getOriginalNumVariables ()

Detailed Description

Definition at line 7 of file LinearBooleanProblemOrBuilder.java.

Member Function Documentation

getAssignment()

com.google.ortools.sat.BooleanAssignment com.google.ortools.sat.LinearBooleanProblemOrBuilder.getAssignment

(

)

Stores an assignment of the problem variables. That may be an initial
feasible solution, just a partial assignment or the optimal solution.

optional .operations_research.sat.BooleanAssignment assignment = 7;

Returns

The assignment.

Implemented in com.google.ortools.sat.LinearBooleanProblem, and com.google.ortools.sat.LinearBooleanProblem.Builder.

getAssignmentOrBuilder()

com.google.ortools.sat.BooleanAssignmentOrBuilder com.google.ortools.sat.LinearBooleanProblemOrBuilder.getAssignmentOrBuilder

(

)

Stores an assignment of the problem variables. That may be an initial
feasible solution, just a partial assignment or the optimal solution.

optional .operations_research.sat.BooleanAssignment assignment = 7;

Implemented in com.google.ortools.sat.LinearBooleanProblem, and com.google.ortools.sat.LinearBooleanProblem.Builder.

getConstraints()

com.google.ortools.sat.LinearBooleanConstraint com.google.ortools.sat.LinearBooleanProblemOrBuilder.getConstraints

(

int

index

)

The constraints of the problem.

repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;

Implemented in com.google.ortools.sat.LinearBooleanProblem, and com.google.ortools.sat.LinearBooleanProblem.Builder.

getConstraintsCount()

int com.google.ortools.sat.LinearBooleanProblemOrBuilder.getConstraintsCount

(

)

The constraints of the problem.

repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;

Implemented in com.google.ortools.sat.LinearBooleanProblem, and com.google.ortools.sat.LinearBooleanProblem.Builder.

getConstraintsList()

java.util.List< com.google.ortools.sat.LinearBooleanConstraint > com.google.ortools.sat.LinearBooleanProblemOrBuilder.getConstraintsList

(

)

The constraints of the problem.

repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;

Implemented in com.google.ortools.sat.LinearBooleanProblem, and com.google.ortools.sat.LinearBooleanProblem.Builder.

getConstraintsOrBuilder()

com.google.ortools.sat.LinearBooleanConstraintOrBuilder com.google.ortools.sat.LinearBooleanProblemOrBuilder.getConstraintsOrBuilder

(

int

index

)

The constraints of the problem.

repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;

Implemented in com.google.ortools.sat.LinearBooleanProblem, and com.google.ortools.sat.LinearBooleanProblem.Builder.

getConstraintsOrBuilderList()

java.util.List<? extends com.google.ortools.sat.LinearBooleanConstraintOrBuilder > com.google.ortools.sat.LinearBooleanProblemOrBuilder.getConstraintsOrBuilderList

(

)

The constraints of the problem.

repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;

Implemented in com.google.ortools.sat.LinearBooleanProblem, and com.google.ortools.sat.LinearBooleanProblem.Builder.

getName()

java.lang.String com.google.ortools.sat.LinearBooleanProblemOrBuilder.getName

(

)

The name of the problem.

optional string name = 1 [default = ""];

Returns

The name.

Implemented in com.google.ortools.sat.LinearBooleanProblem, and com.google.ortools.sat.LinearBooleanProblem.Builder.

getNameBytes()

com.google.protobuf.ByteString com.google.ortools.sat.LinearBooleanProblemOrBuilder.getNameBytes

(

)

The name of the problem.

optional string name = 1 [default = ""];

Returns

The bytes for name.

Implemented in com.google.ortools.sat.LinearBooleanProblem, and com.google.ortools.sat.LinearBooleanProblem.Builder.

getNumVariables()

int com.google.ortools.sat.LinearBooleanProblemOrBuilder.getNumVariables

(

)

The number of variables in the problem.
All the signed representation of the problem literals must be in
[-num_variables, num_variables], excluding 0.

optional int32 num_variables = 3;

Returns

The numVariables.

Implemented in com.google.ortools.sat.LinearBooleanProblem, and com.google.ortools.sat.LinearBooleanProblem.Builder.

getObjective()

com.google.ortools.sat.LinearObjective com.google.ortools.sat.LinearBooleanProblemOrBuilder.getObjective

(

)

The objective of the problem.
If left empty, we just have a satisfiability problem.

optional .operations_research.sat.LinearObjective objective = 5;

Returns

The objective.

Implemented in com.google.ortools.sat.LinearBooleanProblem, and com.google.ortools.sat.LinearBooleanProblem.Builder.

getObjectiveOrBuilder()

com.google.ortools.sat.LinearObjectiveOrBuilder com.google.ortools.sat.LinearBooleanProblemOrBuilder.getObjectiveOrBuilder

(

)

The objective of the problem.
If left empty, we just have a satisfiability problem.

optional .operations_research.sat.LinearObjective objective = 5;

Implemented in com.google.ortools.sat.LinearBooleanProblem, and com.google.ortools.sat.LinearBooleanProblem.Builder.

getOriginalNumVariables()

int com.google.ortools.sat.LinearBooleanProblemOrBuilder.getOriginalNumVariables

(

)

Hack: When converting a wcnf formulat to a LinearBooleanProblem, extra
variables need to be created. This stores the number of variables in the
original problem (which are in one to one correspondence with the first
variables of this problem).

optional int32 original_num_variables = 8;

Returns

The originalNumVariables.

Implemented in com.google.ortools.sat.LinearBooleanProblem, and com.google.ortools.sat.LinearBooleanProblem.Builder.

getVarNames()

java.lang.String com.google.ortools.sat.LinearBooleanProblemOrBuilder.getVarNames

(

int

index

)

The names of the problem variables. The variables index are 0-based and
var_names[i] will be the name of the i-th variable which correspond to
literals +(i + 1) or -(i + 1). This is optional and can be left empty.

repeated string var_names = 6;

Parameters

index

The index of the element to return.

Returns

The varNames at the given index.

Implemented in com.google.ortools.sat.LinearBooleanProblem, and com.google.ortools.sat.LinearBooleanProblem.Builder.

getVarNamesBytes()

com.google.protobuf.ByteString com.google.ortools.sat.LinearBooleanProblemOrBuilder.getVarNamesBytes

(

int

index

)

The names of the problem variables. The variables index are 0-based and
var_names[i] will be the name of the i-th variable which correspond to
literals +(i + 1) or -(i + 1). This is optional and can be left empty.

repeated string var_names = 6;

Parameters

index

The index of the value to return.

Returns

The bytes of the varNames at the given index.

Implemented in com.google.ortools.sat.LinearBooleanProblem, and com.google.ortools.sat.LinearBooleanProblem.Builder.

getVarNamesCount()

int com.google.ortools.sat.LinearBooleanProblemOrBuilder.getVarNamesCount

(

)

The names of the problem variables. The variables index are 0-based and
var_names[i] will be the name of the i-th variable which correspond to
literals +(i + 1) or -(i + 1). This is optional and can be left empty.

repeated string var_names = 6;

Returns

The count of varNames.

Implemented in com.google.ortools.sat.LinearBooleanProblem, and com.google.ortools.sat.LinearBooleanProblem.Builder.

getVarNamesList()

java.util.List< java.lang.String > com.google.ortools.sat.LinearBooleanProblemOrBuilder.getVarNamesList

(

)

The names of the problem variables. The variables index are 0-based and
var_names[i] will be the name of the i-th variable which correspond to
literals +(i + 1) or -(i + 1). This is optional and can be left empty.

repeated string var_names = 6;

Returns

A list containing the varNames.

Implemented in com.google.ortools.sat.LinearBooleanProblem, and com.google.ortools.sat.LinearBooleanProblem.Builder.

hasAssignment()

boolean com.google.ortools.sat.LinearBooleanProblemOrBuilder.hasAssignment

(

)

Stores an assignment of the problem variables. That may be an initial
feasible solution, just a partial assignment or the optimal solution.

optional .operations_research.sat.BooleanAssignment assignment = 7;

Returns

Whether the assignment field is set.

Implemented in com.google.ortools.sat.LinearBooleanProblem, and com.google.ortools.sat.LinearBooleanProblem.Builder.

hasName()

boolean com.google.ortools.sat.LinearBooleanProblemOrBuilder.hasName

(

)

The name of the problem.

optional string name = 1 [default = ""];

Returns

Whether the name field is set.

Implemented in com.google.ortools.sat.LinearBooleanProblem, and com.google.ortools.sat.LinearBooleanProblem.Builder.

hasNumVariables()

boolean com.google.ortools.sat.LinearBooleanProblemOrBuilder.hasNumVariables

(

)

The number of variables in the problem.
All the signed representation of the problem literals must be in
[-num_variables, num_variables], excluding 0.

optional int32 num_variables = 3;

Returns

Whether the numVariables field is set.

Implemented in com.google.ortools.sat.LinearBooleanProblem, and com.google.ortools.sat.LinearBooleanProblem.Builder.

hasObjective()

boolean com.google.ortools.sat.LinearBooleanProblemOrBuilder.hasObjective

(

)

The objective of the problem.
If left empty, we just have a satisfiability problem.

optional .operations_research.sat.LinearObjective objective = 5;

Returns

Whether the objective field is set.

Implemented in com.google.ortools.sat.LinearBooleanProblem, and com.google.ortools.sat.LinearBooleanProblem.Builder.

hasOriginalNumVariables()

boolean com.google.ortools.sat.LinearBooleanProblemOrBuilder.hasOriginalNumVariables

(

)

Hack: When converting a wcnf formulat to a LinearBooleanProblem, extra
variables need to be created. This stores the number of variables in the
original problem (which are in one to one correspondence with the first
variables of this problem).

optional int32 original_num_variables = 8;

Returns

Whether the originalNumVariables field is set.

Implemented in com.google.ortools.sat.LinearBooleanProblem, and com.google.ortools.sat.LinearBooleanProblem.Builder.

---

The documentation for this interface was generated from the following file:

• build/java/ortools-java/src/main/java/com/google/ortools/sat/LinearBooleanProblemOrBuilder.java