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

Classes
class	Builder

Public Member Functions
int	getStatusValue ()

com.google.ortools.sat.CpSolverStatus	getStatus ()

java.util.List< java.lang.Long >	getSolutionList ()

int	getSolutionCount ()

long	getSolution (int index)

double	getObjectiveValue ()

double	getBestObjectiveBound ()

java.util.List< com.google.ortools.sat.CpSolverSolution >	getAdditionalSolutionsList ()

java.util.List<? extends com.google.ortools.sat.CpSolverSolutionOrBuilder >	getAdditionalSolutionsOrBuilderList ()

int	getAdditionalSolutionsCount ()

com.google.ortools.sat.CpSolverSolution	getAdditionalSolutions (int index)

com.google.ortools.sat.CpSolverSolutionOrBuilder	getAdditionalSolutionsOrBuilder (int index)

java.util.List< com.google.ortools.sat.IntegerVariableProto >	getTightenedVariablesList ()

java.util.List<? extends com.google.ortools.sat.IntegerVariableProtoOrBuilder >	getTightenedVariablesOrBuilderList ()

int	getTightenedVariablesCount ()

com.google.ortools.sat.IntegerVariableProto	getTightenedVariables (int index)

com.google.ortools.sat.IntegerVariableProtoOrBuilder	getTightenedVariablesOrBuilder (int index)

java.util.List< java.lang.Integer >	getSufficientAssumptionsForInfeasibilityList ()

int	getSufficientAssumptionsForInfeasibilityCount ()

int	getSufficientAssumptionsForInfeasibility (int index)

boolean	hasIntegerObjective ()

com.google.ortools.sat.CpObjectiveProto	getIntegerObjective ()

com.google.ortools.sat.CpObjectiveProtoOrBuilder	getIntegerObjectiveOrBuilder ()

long	getInnerObjectiveLowerBound ()

long	getNumIntegers ()

long	getNumBooleans ()

long	getNumConflicts ()

long	getNumBranches ()

long	getNumBinaryPropagations ()

long	getNumIntegerPropagations ()

long	getNumRestarts ()

long	getNumLpIterations ()

double	getWallTime ()

double	getUserTime ()

double	getDeterministicTime ()

double	getGapIntegral ()

java.lang.String	getSolutionInfo ()

com.google.protobuf.ByteString	getSolutionInfoBytes ()

java.lang.String	getSolveLog ()

com.google.protobuf.ByteString	getSolveLogBytes ()

final boolean	isInitialized ()

void	writeTo (com.google.protobuf.CodedOutputStream output) throws java.io.IOException

int	getSerializedSize ()

boolean	equals (final java.lang.Object obj)

int	hashCode ()

Builder	newBuilderForType ()

Builder	toBuilder ()

com.google.protobuf.Parser< CpSolverResponse >	getParserForType ()

com.google.ortools.sat.CpSolverResponse	getDefaultInstanceForType ()

Static Public Member Functions
static final com.google.protobuf.Descriptors.Descriptor	getDescriptor ()

static com.google.ortools.sat.CpSolverResponse	parseFrom (java.nio.ByteBuffer data) throws com.google.protobuf.InvalidProtocolBufferException

static com.google.ortools.sat.CpSolverResponse	parseFrom (java.nio.ByteBuffer data, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws com.google.protobuf.InvalidProtocolBufferException

static com.google.ortools.sat.CpSolverResponse	parseFrom (com.google.protobuf.ByteString data) throws com.google.protobuf.InvalidProtocolBufferException

static com.google.ortools.sat.CpSolverResponse	parseFrom (com.google.protobuf.ByteString data, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws com.google.protobuf.InvalidProtocolBufferException

static com.google.ortools.sat.CpSolverResponse	parseFrom (byte[] data) throws com.google.protobuf.InvalidProtocolBufferException

static com.google.ortools.sat.CpSolverResponse	parseFrom (byte[] data, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws com.google.protobuf.InvalidProtocolBufferException

static com.google.ortools.sat.CpSolverResponse	parseFrom (java.io.InputStream input) throws java.io.IOException

static com.google.ortools.sat.CpSolverResponse	parseFrom (java.io.InputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException

static com.google.ortools.sat.CpSolverResponse	parseDelimitedFrom (java.io.InputStream input) throws java.io.IOException

static com.google.ortools.sat.CpSolverResponse	parseDelimitedFrom (java.io.InputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException

static com.google.ortools.sat.CpSolverResponse	parseFrom (com.google.protobuf.CodedInputStream input) throws java.io.IOException

static com.google.ortools.sat.CpSolverResponse	parseFrom (com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException

static Builder	newBuilder ()

static Builder	newBuilder (com.google.ortools.sat.CpSolverResponse prototype)

static com.google.ortools.sat.CpSolverResponse	getDefaultInstance ()

static com.google.protobuf.Parser< CpSolverResponse >	parser ()

Static Public Attributes
static final int	STATUS_FIELD_NUMBER = 1

static final int	SOLUTION_FIELD_NUMBER = 2

static final int	OBJECTIVE_VALUE_FIELD_NUMBER = 3

static final int	BEST_OBJECTIVE_BOUND_FIELD_NUMBER = 4

static final int	ADDITIONAL_SOLUTIONS_FIELD_NUMBER = 27

static final int	TIGHTENED_VARIABLES_FIELD_NUMBER = 21

static final int	SUFFICIENT_ASSUMPTIONS_FOR_INFEASIBILITY_FIELD_NUMBER = 23

static final int	INTEGER_OBJECTIVE_FIELD_NUMBER = 28

static final int	INNER_OBJECTIVE_LOWER_BOUND_FIELD_NUMBER = 29

static final int	NUM_INTEGERS_FIELD_NUMBER = 30

static final int	NUM_BOOLEANS_FIELD_NUMBER = 10

static final int	NUM_CONFLICTS_FIELD_NUMBER = 11

static final int	NUM_BRANCHES_FIELD_NUMBER = 12

static final int	NUM_BINARY_PROPAGATIONS_FIELD_NUMBER = 13

static final int	NUM_INTEGER_PROPAGATIONS_FIELD_NUMBER = 14

static final int	NUM_RESTARTS_FIELD_NUMBER = 24

static final int	NUM_LP_ITERATIONS_FIELD_NUMBER = 25

static final int	WALL_TIME_FIELD_NUMBER = 15

static final int	USER_TIME_FIELD_NUMBER = 16

static final int	DETERMINISTIC_TIME_FIELD_NUMBER = 17

static final int	GAP_INTEGRAL_FIELD_NUMBER = 22

static final int	SOLUTION_INFO_FIELD_NUMBER = 20

static final int	SOLVE_LOG_FIELD_NUMBER = 26

Protected Member Functions
java.lang.Object	newInstance (UnusedPrivateParameter unused)

com.google.protobuf.GeneratedMessageV3.FieldAccessorTable	internalGetFieldAccessorTable ()

Builder	newBuilderForType (com.google.protobuf.GeneratedMessageV3.BuilderParent parent)

Detailed Description

The response returned by a solver trying to solve a CpModelProto.

Next id: 31

Protobuf type operations_research.sat.CpSolverResponse

Definition at line 16 of file CpSolverResponse.java.

Member Function Documentation

◆ equals()

boolean com.google.ortools.sat.CpSolverResponse.equals ( final java.lang.Object obj )

Definition at line 993 of file CpSolverResponse.java.

◆ getAdditionalSolutions()

com.google.ortools.sat.CpSolverSolution com.google.ortools.sat.CpSolverResponse.getAdditionalSolutions ( int index )

If the parameter fill_additional_solutions_in_response is set, then we
copy all the solutions from our internal solution pool here.

Note that the one returned in the solution field will likely appear here
too. Do not rely on the solutions order as it depends on our internal
representation (after postsolve).

repeated .operations_research.sat.CpSolverSolution additional_solutions = 27;

Implements com.google.ortools.sat.CpSolverResponseOrBuilder.

Definition at line 233 of file CpSolverResponse.java.

◆ getAdditionalSolutionsCount()

int com.google.ortools.sat.CpSolverResponse.getAdditionalSolutionsCount ( )

If the parameter fill_additional_solutions_in_response is set, then we
copy all the solutions from our internal solution pool here.

Note that the one returned in the solution field will likely appear here
too. Do not rely on the solutions order as it depends on our internal
representation (after postsolve).

repeated .operations_research.sat.CpSolverSolution additional_solutions = 27;

Implements com.google.ortools.sat.CpSolverResponseOrBuilder.

Definition at line 217 of file CpSolverResponse.java.

◆ getAdditionalSolutionsList()

java.util.List< com.google.ortools.sat.CpSolverSolution > com.google.ortools.sat.CpSolverResponse.getAdditionalSolutionsList ( )

If the parameter fill_additional_solutions_in_response is set, then we
copy all the solutions from our internal solution pool here.

Note that the one returned in the solution field will likely appear here
too. Do not rely on the solutions order as it depends on our internal
representation (after postsolve).

repeated .operations_research.sat.CpSolverSolution additional_solutions = 27;

Implements com.google.ortools.sat.CpSolverResponseOrBuilder.

Definition at line 184 of file CpSolverResponse.java.

◆ getAdditionalSolutionsOrBuilder()

com.google.ortools.sat.CpSolverSolutionOrBuilder com.google.ortools.sat.CpSolverResponse.getAdditionalSolutionsOrBuilder ( int index )

If the parameter fill_additional_solutions_in_response is set, then we
copy all the solutions from our internal solution pool here.

Note that the one returned in the solution field will likely appear here
too. Do not rely on the solutions order as it depends on our internal
representation (after postsolve).

repeated .operations_research.sat.CpSolverSolution additional_solutions = 27;

Implements com.google.ortools.sat.CpSolverResponseOrBuilder.

Definition at line 249 of file CpSolverResponse.java.

◆ getAdditionalSolutionsOrBuilderList()

java.util.List<? extends com.google.ortools.sat.CpSolverSolutionOrBuilder > com.google.ortools.sat.CpSolverResponse.getAdditionalSolutionsOrBuilderList ( )

If the parameter fill_additional_solutions_in_response is set, then we
copy all the solutions from our internal solution pool here.

Note that the one returned in the solution field will likely appear here
too. Do not rely on the solutions order as it depends on our internal
representation (after postsolve).

repeated .operations_research.sat.CpSolverSolution additional_solutions = 27;

Implements com.google.ortools.sat.CpSolverResponseOrBuilder.

Definition at line 201 of file CpSolverResponse.java.

◆ getBestObjectiveBound()

double com.google.ortools.sat.CpSolverResponse.getBestObjectiveBound ( )

Only make sense for an optimization problem. A proven lower-bound on the
objective for a minimization problem, or a proven upper-bound for a
maximization problem.

double best_objective_bound = 4;

Returns: The bestObjectiveBound.

Implements com.google.ortools.sat.CpSolverResponseOrBuilder.

Definition at line 164 of file CpSolverResponse.java.

◆ getDefaultInstance()

static com.google.ortools.sat.CpSolverResponse com.google.ortools.sat.CpSolverResponse.getDefaultInstance ( )

static

Definition at line 4166 of file CpSolverResponse.java.

◆ getDefaultInstanceForType()

com.google.ortools.sat.CpSolverResponse com.google.ortools.sat.CpSolverResponse.getDefaultInstanceForType ( )

Definition at line 4202 of file CpSolverResponse.java.

◆ getDescriptor()

static final com.google.protobuf.Descriptors.Descriptor com.google.ortools.sat.CpSolverResponse.getDescriptor ( )

static

Definition at line 43 of file CpSolverResponse.java.

◆ getDeterministicTime()

double com.google.ortools.sat.CpSolverResponse.getDeterministicTime ( )

double deterministic_time = 17;

Returns: The deterministicTime.

Implements com.google.ortools.sat.CpSolverResponseOrBuilder.

Definition at line 659 of file CpSolverResponse.java.

◆ getGapIntegral()

double com.google.ortools.sat.CpSolverResponse.getGapIntegral ( )

The integral of log(1 + absolute_objective_gap) over time.

double gap_integral = 22;

Returns: The gapIntegral.

Implements com.google.ortools.sat.CpSolverResponseOrBuilder.

Definition at line 674 of file CpSolverResponse.java.

◆ getInnerObjectiveLowerBound()

long com.google.ortools.sat.CpSolverResponse.getInnerObjectiveLowerBound ( )

Advanced usage.

A lower bound on the inner integer expression of the objective. This is
either a bound on the expression in the returned integer_objective or on
the integer expression of the original objective if the problem already has
an integer objective.

int64 inner_objective_lower_bound = 29;

Returns: The innerObjectiveLowerBound.

Implements com.google.ortools.sat.CpSolverResponseOrBuilder.

Definition at line 526 of file CpSolverResponse.java.

◆ getIntegerObjective()

com.google.ortools.sat.CpObjectiveProto com.google.ortools.sat.CpSolverResponse.getIntegerObjective ( )

Contains the integer objective optimized internally. This is only filled if
the problem had a floating point objective, and on the final response, not
the ones given to callbacks.

.operations_research.sat.CpObjectiveProto integer_objective = 28;

Returns: The integerObjective.

Implements com.google.ortools.sat.CpSolverResponseOrBuilder.

Definition at line 493 of file CpSolverResponse.java.

◆ getIntegerObjectiveOrBuilder()

com.google.ortools.sat.CpObjectiveProtoOrBuilder com.google.ortools.sat.CpSolverResponse.getIntegerObjectiveOrBuilder ( )

Contains the integer objective optimized internally. This is only filled if
the problem had a floating point objective, and on the final response, not
the ones given to callbacks.

.operations_research.sat.CpObjectiveProto integer_objective = 28;

Implements com.google.ortools.sat.CpSolverResponseOrBuilder.

Definition at line 506 of file CpSolverResponse.java.

◆ getNumBinaryPropagations()

long com.google.ortools.sat.CpSolverResponse.getNumBinaryPropagations ( )

int64 num_binary_propagations = 13;

Returns: The numBinaryPropagations.

Implements com.google.ortools.sat.CpSolverResponseOrBuilder.

Definition at line 589 of file CpSolverResponse.java.

◆ getNumBooleans()

long com.google.ortools.sat.CpSolverResponse.getNumBooleans ( )

int64 num_booleans = 10;

Returns: The numBooleans.

Implements com.google.ortools.sat.CpSolverResponseOrBuilder.

Definition at line 556 of file CpSolverResponse.java.

◆ getNumBranches()

long com.google.ortools.sat.CpSolverResponse.getNumBranches ( )

int64 num_branches = 12;

Returns: The numBranches.

Implements com.google.ortools.sat.CpSolverResponseOrBuilder.

Definition at line 578 of file CpSolverResponse.java.

◆ getNumConflicts()

long com.google.ortools.sat.CpSolverResponse.getNumConflicts ( )

int64 num_conflicts = 11;

Returns: The numConflicts.

Implements com.google.ortools.sat.CpSolverResponseOrBuilder.

Definition at line 567 of file CpSolverResponse.java.

◆ getNumIntegerPropagations()

long com.google.ortools.sat.CpSolverResponse.getNumIntegerPropagations ( )

int64 num_integer_propagations = 14;

Returns: The numIntegerPropagations.

Implements com.google.ortools.sat.CpSolverResponseOrBuilder.

Definition at line 600 of file CpSolverResponse.java.

◆ getNumIntegers()

long com.google.ortools.sat.CpSolverResponse.getNumIntegers ( )

Some statistics about the solve.

Important: in multithread, this correspond the statistics of the first
subsolver. Which is usually the one with the user defined parameters. Or
the default-search if none are specified.

int64 num_integers = 30;

Returns: The numIntegers.

Implements com.google.ortools.sat.CpSolverResponseOrBuilder.

Definition at line 545 of file CpSolverResponse.java.

◆ getNumLpIterations()

long com.google.ortools.sat.CpSolverResponse.getNumLpIterations ( )

int64 num_lp_iterations = 25;

Returns: The numLpIterations.

Implements com.google.ortools.sat.CpSolverResponseOrBuilder.

Definition at line 622 of file CpSolverResponse.java.

◆ getNumRestarts()

long com.google.ortools.sat.CpSolverResponse.getNumRestarts ( )

int64 num_restarts = 24;

Returns: The numRestarts.

Implements com.google.ortools.sat.CpSolverResponseOrBuilder.

Definition at line 611 of file CpSolverResponse.java.

◆ getObjectiveValue()

double com.google.ortools.sat.CpSolverResponse.getObjectiveValue ( )

Only make sense for an optimization problem. The objective value of the
returned solution if it is non-empty. If there is no solution, then for a
minimization problem, this will be an upper-bound of the objective of any
feasible solution, and a lower-bound for a maximization problem.

double objective_value = 3;

Returns: The objectiveValue.

Implements com.google.ortools.sat.CpSolverResponseOrBuilder.

Definition at line 147 of file CpSolverResponse.java.

◆ getParserForType()

com.google.protobuf.Parser< CpSolverResponse > com.google.ortools.sat.CpSolverResponse.getParserForType ( )

Definition at line 4197 of file CpSolverResponse.java.

◆ getSerializedSize()

int com.google.ortools.sat.CpSolverResponse.getSerializedSize ( )

Definition at line 872 of file CpSolverResponse.java.

◆ getSolution()

long com.google.ortools.sat.CpSolverResponse.getSolution ( int index )

A feasible solution to the given problem. Depending on the returned status
it may be optimal or just feasible. This is in one-to-one correspondence
with a CpModelProto::variables repeated field and list the values of all
the variables.

repeated int64 solution = 2;

Parameters

index The index of the element to return.

Returns: The solution at the given index.

Implements com.google.ortools.sat.CpSolverResponseOrBuilder.

Definition at line 128 of file CpSolverResponse.java.

◆ getSolutionCount()

int com.google.ortools.sat.CpSolverResponse.getSolutionCount ( )

A feasible solution to the given problem. Depending on the returned status
it may be optimal or just feasible. This is in one-to-one correspondence
with a CpModelProto::variables repeated field and list the values of all
the variables.

repeated int64 solution = 2;

Returns: The count of solution.

Implements com.google.ortools.sat.CpSolverResponseOrBuilder.

Definition at line 113 of file CpSolverResponse.java.

◆ getSolutionInfo()

java.lang.String com.google.ortools.sat.CpSolverResponse.getSolutionInfo ( )

Additional information about how the solution was found. It also stores
model or parameters errors that caused the model to be invalid.

string solution_info = 20;

Returns: The solutionInfo.

Implements com.google.ortools.sat.CpSolverResponseOrBuilder.

Definition at line 691 of file CpSolverResponse.java.

◆ getSolutionInfoBytes()

com.google.protobuf.ByteString com.google.ortools.sat.CpSolverResponse.getSolutionInfoBytes ( )

Additional information about how the solution was found. It also stores
model or parameters errors that caused the model to be invalid.

string solution_info = 20;

Returns: The bytes for solutionInfo.

Implements com.google.ortools.sat.CpSolverResponseOrBuilder.

Definition at line 714 of file CpSolverResponse.java.

◆ getSolutionList()

java.util.List< java.lang.Long > com.google.ortools.sat.CpSolverResponse.getSolutionList ( )

A feasible solution to the given problem. Depending on the returned status
it may be optimal or just feasible. This is in one-to-one correspondence
with a CpModelProto::variables repeated field and list the values of all
the variables.

repeated int64 solution = 2;

Returns: A list containing the solution.

Implements com.google.ortools.sat.CpSolverResponseOrBuilder.

Definition at line 99 of file CpSolverResponse.java.

◆ getSolveLog()

java.lang.String com.google.ortools.sat.CpSolverResponse.getSolveLog ( )

The solve log will be filled if the parameter log_to_response is set to
true.

string solve_log = 26;

Returns: The solveLog.

Implements com.google.ortools.sat.CpSolverResponseOrBuilder.

Definition at line 740 of file CpSolverResponse.java.

◆ getSolveLogBytes()

com.google.protobuf.ByteString com.google.ortools.sat.CpSolverResponse.getSolveLogBytes ( )

The solve log will be filled if the parameter log_to_response is set to
true.

string solve_log = 26;

Returns: The bytes for solveLog.

Implements com.google.ortools.sat.CpSolverResponseOrBuilder.

Definition at line 763 of file CpSolverResponse.java.

◆ getStatus()

com.google.ortools.sat.CpSolverStatus com.google.ortools.sat.CpSolverResponse.getStatus ( )

The status of the solve.

.operations_research.sat.CpSolverStatus status = 1;

Returns: The status.

Implements com.google.ortools.sat.CpSolverResponseOrBuilder.

Definition at line 77 of file CpSolverResponse.java.

◆ getStatusValue()

int com.google.ortools.sat.CpSolverResponse.getStatusValue ( )

The status of the solve.

.operations_research.sat.CpSolverStatus status = 1;

Returns: The enum numeric value on the wire for status.

Implements com.google.ortools.sat.CpSolverResponseOrBuilder.

Definition at line 66 of file CpSolverResponse.java.

◆ getSufficientAssumptionsForInfeasibility()

int com.google.ortools.sat.CpSolverResponse.getSufficientAssumptionsForInfeasibility ( int index )

A subset of the model "assumptions" field. This will only be filled if the
status is INFEASIBLE. This subset of assumption will be enough to still get
an infeasible problem.

This is related to what is called the irreducible inconsistent subsystem or
IIS. Except one is only concerned by the provided assumptions. There is
also no guarantee that we return an irreducible (aka minimal subset).
However, this is based on SAT explanation and there is a good chance it is
not too large.

If you really want a minimal subset, a possible way to get one is by
changing your model to minimize the number of assumptions at false, but
this is likely an harder problem to solve.

Important: Currently, this is minimized only in single-thread and if the
problem is not an optimization problem, otherwise, it will always include
all the assumptions.

TODO(user): Allows for returning multiple core at once.

repeated int32 sufficient_assumptions_for_infeasibility = 23;

Parameters

index The index of the element to return.

Returns: The sufficientAssumptionsForInfeasibility at the given index.

Implements com.google.ortools.sat.CpSolverResponseOrBuilder.

Definition at line 461 of file CpSolverResponse.java.

◆ getSufficientAssumptionsForInfeasibilityCount()

int com.google.ortools.sat.CpSolverResponse.getSufficientAssumptionsForInfeasibilityCount ( )

A subset of the model "assumptions" field. This will only be filled if the
status is INFEASIBLE. This subset of assumption will be enough to still get
an infeasible problem.

This is related to what is called the irreducible inconsistent subsystem or
IIS. Except one is only concerned by the provided assumptions. There is
also no guarantee that we return an irreducible (aka minimal subset).
However, this is based on SAT explanation and there is a good chance it is
not too large.

If you really want a minimal subset, a possible way to get one is by
changing your model to minimize the number of assumptions at false, but
this is likely an harder problem to solve.

Important: Currently, this is minimized only in single-thread and if the
problem is not an optimization problem, otherwise, it will always include
all the assumptions.

TODO(user): Allows for returning multiple core at once.

repeated int32 sufficient_assumptions_for_infeasibility = 23;

Returns: The count of sufficientAssumptionsForInfeasibility.

Implements com.google.ortools.sat.CpSolverResponseOrBuilder.

Definition at line 431 of file CpSolverResponse.java.

◆ getSufficientAssumptionsForInfeasibilityList()

java.util.List< java.lang.Integer > com.google.ortools.sat.CpSolverResponse.getSufficientAssumptionsForInfeasibilityList ( )

A subset of the model "assumptions" field. This will only be filled if the
status is INFEASIBLE. This subset of assumption will be enough to still get
an infeasible problem.

This is related to what is called the irreducible inconsistent subsystem or
IIS. Except one is only concerned by the provided assumptions. There is
also no guarantee that we return an irreducible (aka minimal subset).
However, this is based on SAT explanation and there is a good chance it is
not too large.

If you really want a minimal subset, a possible way to get one is by
changing your model to minimize the number of assumptions at false, but
this is likely an harder problem to solve.

Important: Currently, this is minimized only in single-thread and if the
problem is not an optimization problem, otherwise, it will always include
all the assumptions.

TODO(user): Allows for returning multiple core at once.

repeated int32 sufficient_assumptions_for_infeasibility = 23;

Returns: A list containing the sufficientAssumptionsForInfeasibility.

Implements com.google.ortools.sat.CpSolverResponseOrBuilder.

Definition at line 402 of file CpSolverResponse.java.

◆ getTightenedVariables()

com.google.ortools.sat.IntegerVariableProto com.google.ortools.sat.CpSolverResponse.getTightenedVariables ( int index )

Advanced usage.

If the option fill_tightened_domains_in_response is set, then this field
will be a copy of the CpModelProto.variables where each domain has been
reduced using the information the solver was able to derive. Note that this
is only filled with the info derived during a normal search and we do not
have any dedicated algorithm to improve it.

If the problem is a feasibility problem, then these bounds will be valid
for any feasible solution. If the problem is an optimization problem, then
these bounds will only be valid for any OPTIMAL solutions, it can exclude
sub-optimal feasible ones.