Inheritance diagram for operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder:

Public Member Functions
Builder	clear ()

com.google.protobuf.Descriptors.Descriptor	getDescriptorForType ()

operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation	getDefaultInstanceForType ()

operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation	build ()

operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation	buildPartial ()

Builder	clone ()

Builder	setField (com.google.protobuf.Descriptors.FieldDescriptor field, java.lang.Object value)

Builder	clearField (com.google.protobuf.Descriptors.FieldDescriptor field)

Builder	clearOneof (com.google.protobuf.Descriptors.OneofDescriptor oneof)

Builder	setRepeatedField (com.google.protobuf.Descriptors.FieldDescriptor field, int index, java.lang.Object value)

Builder	addRepeatedField (com.google.protobuf.Descriptors.FieldDescriptor field, java.lang.Object value)

Builder	mergeFrom (com.google.protobuf.Message other)

Builder	mergeFrom (operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation other)

final boolean	isInitialized ()

Builder	mergeFrom (com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException

boolean	hasMaxPrimalRayInfeasibility ()

double	getMaxPrimalRayInfeasibility ()

Builder	setMaxPrimalRayInfeasibility (double value)

Builder	clearMaxPrimalRayInfeasibility ()

boolean	hasPrimalRayLinearObjective ()

double	getPrimalRayLinearObjective ()

Builder	setPrimalRayLinearObjective (double value)

Builder	clearPrimalRayLinearObjective ()

boolean	hasPrimalRayQuadraticNorm ()

double	getPrimalRayQuadraticNorm ()

Builder	setPrimalRayQuadraticNorm (double value)

Builder	clearPrimalRayQuadraticNorm ()

boolean	hasMaxDualRayInfeasibility ()

double	getMaxDualRayInfeasibility ()

Builder	setMaxDualRayInfeasibility (double value)

Builder	clearMaxDualRayInfeasibility ()

boolean	hasDualRayObjective ()

double	getDualRayObjective ()

Builder	setDualRayObjective (double value)

Builder	clearDualRayObjective ()

boolean	hasCandidateType ()

operations_research.pdlp.SolveLogOuterClass.PointType	getCandidateType ()

Builder	setCandidateType (operations_research.pdlp.SolveLogOuterClass.PointType value)

Builder	clearCandidateType ()

final Builder	setUnknownFields (final com.google.protobuf.UnknownFieldSet unknownFields)

final Builder	mergeUnknownFields (final com.google.protobuf.UnknownFieldSet unknownFields)

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

Protected Member Functions
com.google.protobuf.GeneratedMessageV3.FieldAccessorTable	internalGetFieldAccessorTable ()

Detailed Description

Information measuring how close a point is to establishing primal or dual
infeasibility (i.e. has no solution); see also TerminationCriteria.

Protobuf type operations_research.pdlp.InfeasibilityInformation

Definition at line 7859 of file SolveLogOuterClass.java.

Member Function Documentation

◆ addRepeatedField()

Builder operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.addRepeatedField	(	com.google.protobuf.Descriptors.FieldDescriptor	field,
		java.lang.Object	value )

Definition at line 7984 of file SolveLogOuterClass.java.

◆ build()

operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.build ( )

Definition at line 7911 of file SolveLogOuterClass.java.

◆ buildPartial()

operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.buildPartial ( )

Definition at line 7920 of file SolveLogOuterClass.java.

◆ clear()

Builder operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.clear ( )

Definition at line 7887 of file SolveLogOuterClass.java.

◆ clearCandidateType()

Builder operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.clearCandidateType ( )

Type of the point used to compute the InfeasibilityInformation.

optional .operations_research.pdlp.PointType candidate_type = 6;

Returns: This builder for chaining.

Definition at line 8510 of file SolveLogOuterClass.java.

◆ clearDualRayObjective()

Builder operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.clearDualRayObjective ( )

The objective of the linear program labeled (1) in the previous paragraph.

optional double dual_ray_objective = 5;

Returns: This builder for chaining.

Definition at line 8452 of file SolveLogOuterClass.java.

◆ clearField()

Builder operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.clearField ( com.google.protobuf.Descriptors.FieldDescriptor field )

Definition at line 7968 of file SolveLogOuterClass.java.

◆ clearMaxDualRayInfeasibility()

Builder operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.clearMaxDualRayInfeasibility ( )

Let (y_ray, r_ray) be the algorithm's estimate of the dual and reduced cost
extreme ray where (y_ray, r_ray) is a vector (satisfying the dual variable
constraints) scaled such that its infinity norm is one. A simple and
typical choice of y_ray is (y_ray, r_ray) = (y, r) / max(| y |_∞, | r |_∞)
where y is the current dual iterate and r is the current dual reduced
costs. Consider the quadratic program we are solving but with the objective
(both quadratic and linear terms) set to zero. This forms a linear program
(label this linear program (1)) with no objective. Take the dual of (1) and
compute the maximum absolute value of the constraint error for
(y_ray, r_ray) to obtain the value of max_dual_ray_infeasibility.

optional double max_dual_ray_infeasibility = 4;

Returns: This builder for chaining.

Definition at line 8396 of file SolveLogOuterClass.java.

◆ clearMaxPrimalRayInfeasibility()

Builder operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.clearMaxPrimalRayInfeasibility ( )

Let x_ray be the algorithm's estimate of the primal extreme ray where x_ray
is a vector that satisfies the sign constraints for a ray, scaled such that
its infinity norm is one (the sign constraints are the variable bound
constraints, with all finite bounds mapped to zero). A simple and typical
choice of x_ray is x_ray = x / | x |_∞ where x is the current primal
iterate projected onto the primal ray sign constraints. For this value
compute the maximum absolute error in the primal linear program with the
right hand side set to zero.

optional double max_primal_ray_infeasibility = 1;

Returns: This builder for chaining.

Definition at line 8176 of file SolveLogOuterClass.java.

◆ clearOneof()

Builder operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.clearOneof ( com.google.protobuf.Descriptors.OneofDescriptor oneof )

Definition at line 7973 of file SolveLogOuterClass.java.

◆ clearPrimalRayLinearObjective()

Builder operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.clearPrimalRayLinearObjective ( )

The value of the linear part of the primal objective (ignoring additive
constants) evaluated at x_ray, i.e., c' * x_ray where c is the objective
coefficient vector.

optional double primal_ray_linear_objective = 2;

Returns: This builder for chaining.

Definition at line 8240 of file SolveLogOuterClass.java.

◆ clearPrimalRayQuadraticNorm()

Builder operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.clearPrimalRayQuadraticNorm ( )

The l_∞ norm of the vector resulting from taking the quadratic matrix from
primal objective and multiplying it by the primal variables. For linear
programming problems this is zero.

optional double primal_ray_quadratic_norm = 3;

Returns: This builder for chaining.

Definition at line 8304 of file SolveLogOuterClass.java.

◆ clone()

Builder operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.clone ( )

Definition at line 7958 of file SolveLogOuterClass.java.

◆ getCandidateType()

operations_research.pdlp.SolveLogOuterClass.PointType operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.getCandidateType ( )

Type of the point used to compute the InfeasibilityInformation.

optional .operations_research.pdlp.PointType candidate_type = 6;

Returns: The candidateType.

Implements operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformationOrBuilder.

Definition at line 8480 of file SolveLogOuterClass.java.

◆ getDefaultInstanceForType()

operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.getDefaultInstanceForType ( )

Definition at line 7906 of file SolveLogOuterClass.java.

◆ getDescriptor()

static final com.google.protobuf.Descriptors.Descriptor operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.getDescriptor ( )

static

Definition at line 7864 of file SolveLogOuterClass.java.

◆ getDescriptorForType()

com.google.protobuf.Descriptors.Descriptor operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.getDescriptorForType ( )

Definition at line 7901 of file SolveLogOuterClass.java.

◆ getDualRayObjective()

double operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.getDualRayObjective ( )

The objective of the linear program labeled (1) in the previous paragraph.

optional double dual_ray_objective = 5;

Returns: The dualRayObjective.

Implements operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformationOrBuilder.

Definition at line 8425 of file SolveLogOuterClass.java.

◆ getMaxDualRayInfeasibility()

double operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.getMaxDualRayInfeasibility ( )

Let (y_ray, r_ray) be the algorithm's estimate of the dual and reduced cost
extreme ray where (y_ray, r_ray) is a vector (satisfying the dual variable
constraints) scaled such that its infinity norm is one. A simple and
typical choice of y_ray is (y_ray, r_ray) = (y, r) / max(| y |_∞, | r |_∞)
where y is the current dual iterate and r is the current dual reduced
costs. Consider the quadratic program we are solving but with the objective
(both quadratic and linear terms) set to zero. This forms a linear program
(label this linear program (1)) with no objective. Take the dual of (1) and
compute the maximum absolute value of the constraint error for
(y_ray, r_ray) to obtain the value of max_dual_ray_infeasibility.

optional double max_dual_ray_infeasibility = 4;

Returns: The maxDualRayInfeasibility.

Implements operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformationOrBuilder.

Definition at line 8351 of file SolveLogOuterClass.java.

◆ getMaxPrimalRayInfeasibility()

double operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.getMaxPrimalRayInfeasibility ( )

Let x_ray be the algorithm's estimate of the primal extreme ray where x_ray
is a vector that satisfies the sign constraints for a ray, scaled such that
its infinity norm is one (the sign constraints are the variable bound
constraints, with all finite bounds mapped to zero). A simple and typical
choice of x_ray is x_ray = x / | x |_∞ where x is the current primal
iterate projected onto the primal ray sign constraints. For this value
compute the maximum absolute error in the primal linear program with the
right hand side set to zero.

optional double max_primal_ray_infeasibility = 1;

Returns: The maxPrimalRayInfeasibility.

Implements operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformationOrBuilder.

Definition at line 8135 of file SolveLogOuterClass.java.

◆ getPrimalRayLinearObjective()

double operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.getPrimalRayLinearObjective ( )

The value of the linear part of the primal objective (ignoring additive
constants) evaluated at x_ray, i.e., c' * x_ray where c is the objective
coefficient vector.

optional double primal_ray_linear_objective = 2;

Returns: The primalRayLinearObjective.

Implements operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformationOrBuilder.

Definition at line 8209 of file SolveLogOuterClass.java.

◆ getPrimalRayQuadraticNorm()

double operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.getPrimalRayQuadraticNorm ( )

The l_∞ norm of the vector resulting from taking the quadratic matrix from
primal objective and multiplying it by the primal variables. For linear
programming problems this is zero.

optional double primal_ray_quadratic_norm = 3;

Returns: The primalRayQuadraticNorm.

Implements operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformationOrBuilder.

Definition at line 8273 of file SolveLogOuterClass.java.

◆ hasCandidateType()

boolean operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.hasCandidateType ( )

Type of the point used to compute the InfeasibilityInformation.

optional .operations_research.pdlp.PointType candidate_type = 6;

Returns: Whether the candidateType field is set.

Implements operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformationOrBuilder.

Definition at line 8468 of file SolveLogOuterClass.java.

◆ hasDualRayObjective()

boolean operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.hasDualRayObjective ( )

The objective of the linear program labeled (1) in the previous paragraph.

optional double dual_ray_objective = 5;

Returns: Whether the dualRayObjective field is set.

Implements operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformationOrBuilder.

Definition at line 8413 of file SolveLogOuterClass.java.

◆ hasMaxDualRayInfeasibility()

boolean operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.hasMaxDualRayInfeasibility ( )

Let (y_ray, r_ray) be the algorithm's estimate of the dual and reduced cost
extreme ray where (y_ray, r_ray) is a vector (satisfying the dual variable
constraints) scaled such that its infinity norm is one. A simple and
typical choice of y_ray is (y_ray, r_ray) = (y, r) / max(| y |_∞, | r |_∞)
where y is the current dual iterate and r is the current dual reduced
costs. Consider the quadratic program we are solving but with the objective
(both quadratic and linear terms) set to zero. This forms a linear program
(label this linear program (1)) with no objective. Take the dual of (1) and
compute the maximum absolute value of the constraint error for
(y_ray, r_ray) to obtain the value of max_dual_ray_infeasibility.

optional double max_dual_ray_infeasibility = 4;

Returns: Whether the maxDualRayInfeasibility field is set.

Implements operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformationOrBuilder.

Definition at line 8330 of file SolveLogOuterClass.java.

◆ hasMaxPrimalRayInfeasibility()

boolean operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.hasMaxPrimalRayInfeasibility ( )

Let x_ray be the algorithm's estimate of the primal extreme ray where x_ray
is a vector that satisfies the sign constraints for a ray, scaled such that
its infinity norm is one (the sign constraints are the variable bound
constraints, with all finite bounds mapped to zero). A simple and typical
choice of x_ray is x_ray = x / | x |_∞ where x is the current primal
iterate projected onto the primal ray sign constraints. For this value
compute the maximum absolute error in the primal linear program with the
right hand side set to zero.

optional double max_primal_ray_infeasibility = 1;

Returns: Whether the maxPrimalRayInfeasibility field is set.

Implements operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformationOrBuilder.

Definition at line 8116 of file SolveLogOuterClass.java.

◆ hasPrimalRayLinearObjective()

boolean operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.hasPrimalRayLinearObjective ( )

The value of the linear part of the primal objective (ignoring additive
constants) evaluated at x_ray, i.e., c' * x_ray where c is the objective
coefficient vector.

optional double primal_ray_linear_objective = 2;

Returns: Whether the primalRayLinearObjective field is set.

Implements operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformationOrBuilder.

Definition at line 8195 of file SolveLogOuterClass.java.

◆ hasPrimalRayQuadraticNorm()

boolean operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.hasPrimalRayQuadraticNorm ( )

The l_∞ norm of the vector resulting from taking the quadratic matrix from
primal objective and multiplying it by the primal variables. For linear
programming problems this is zero.

optional double primal_ray_quadratic_norm = 3;

Returns: Whether the primalRayQuadraticNorm field is set.

Implements operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformationOrBuilder.

Definition at line 8259 of file SolveLogOuterClass.java.

◆ internalGetFieldAccessorTable()

com.google.protobuf.GeneratedMessageV3.FieldAccessorTable operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.internalGetFieldAccessorTable ( )

protected

Definition at line 7870 of file SolveLogOuterClass.java.

◆ isInitialized()

final boolean operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.isInitialized ( )

Definition at line 8025 of file SolveLogOuterClass.java.

◆ mergeFrom() [1/3]

Builder operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.mergeFrom	(	com.google.protobuf.CodedInputStream	input,
		com.google.protobuf.ExtensionRegistryLite	extensionRegistry ) throws java.io.IOException

Definition at line 8030 of file SolveLogOuterClass.java.

◆ mergeFrom() [2/3]

Builder operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.mergeFrom ( com.google.protobuf.Message other )

Definition at line 7990 of file SolveLogOuterClass.java.

◆ mergeFrom() [3/3]

Builder operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.mergeFrom ( operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation other )

Definition at line 7999 of file SolveLogOuterClass.java.

◆ mergeUnknownFields()

final Builder operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.mergeUnknownFields ( final com.google.protobuf.UnknownFieldSet unknownFields )

Definition at line 8523 of file SolveLogOuterClass.java.

◆ setCandidateType()

Builder operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.setCandidateType ( operations_research.pdlp.SolveLogOuterClass.PointType value )

Type of the point used to compute the InfeasibilityInformation.

optional .operations_research.pdlp.PointType candidate_type = 6;

Parameters

value The candidateType to set.

Returns: This builder for chaining.

Definition at line 8493 of file SolveLogOuterClass.java.

◆ setDualRayObjective()

Builder operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.setDualRayObjective ( double value )

The objective of the linear program labeled (1) in the previous paragraph.

optional double dual_ray_objective = 5;

Parameters

value The dualRayObjective to set.

Returns: This builder for chaining.

Definition at line 8437 of file SolveLogOuterClass.java.

◆ setField()

Builder operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.setField	(	com.google.protobuf.Descriptors.FieldDescriptor	field,
		java.lang.Object	value )

Definition at line 7962 of file SolveLogOuterClass.java.

◆ setMaxDualRayInfeasibility()

Builder operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.setMaxDualRayInfeasibility ( double value )

Let (y_ray, r_ray) be the algorithm's estimate of the dual and reduced cost
extreme ray where (y_ray, r_ray) is a vector (satisfying the dual variable
constraints) scaled such that its infinity norm is one. A simple and
typical choice of y_ray is (y_ray, r_ray) = (y, r) / max(| y |_∞, | r |_∞)
where y is the current dual iterate and r is the current dual reduced
costs. Consider the quadratic program we are solving but with the objective
(both quadratic and linear terms) set to zero. This forms a linear program
(label this linear program (1)) with no objective. Take the dual of (1) and
compute the maximum absolute value of the constraint error for
(y_ray, r_ray) to obtain the value of max_dual_ray_infeasibility.

optional double max_dual_ray_infeasibility = 4;

Parameters

value The maxDualRayInfeasibility to set.

Returns: This builder for chaining.

Definition at line 8372 of file SolveLogOuterClass.java.

◆ setMaxPrimalRayInfeasibility()

Builder operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.setMaxPrimalRayInfeasibility ( double value )

Let x_ray be the algorithm's estimate of the primal extreme ray where x_ray
is a vector that satisfies the sign constraints for a ray, scaled such that
its infinity norm is one (the sign constraints are the variable bound
constraints, with all finite bounds mapped to zero). A simple and typical
choice of x_ray is x_ray = x / | x |_∞ where x is the current primal
iterate projected onto the primal ray sign constraints. For this value
compute the maximum absolute error in the primal linear program with the
right hand side set to zero.

optional double max_primal_ray_infeasibility = 1;

Parameters

value The maxPrimalRayInfeasibility to set.

Returns: This builder for chaining.

Definition at line 8154 of file SolveLogOuterClass.java.

◆ setPrimalRayLinearObjective()

Builder operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.setPrimalRayLinearObjective ( double value )

The value of the linear part of the primal objective (ignoring additive
constants) evaluated at x_ray, i.e., c' * x_ray where c is the objective
coefficient vector.

optional double primal_ray_linear_objective = 2;

Parameters

value The primalRayLinearObjective to set.

Returns: This builder for chaining.

Definition at line 8223 of file SolveLogOuterClass.java.

◆ setPrimalRayQuadraticNorm()

Builder operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.setPrimalRayQuadraticNorm ( double value )

The l_∞ norm of the vector resulting from taking the quadratic matrix from
primal objective and multiplying it by the primal variables. For linear
programming problems this is zero.

optional double primal_ray_quadratic_norm = 3;

Parameters

value The primalRayQuadraticNorm to set.

Returns: This builder for chaining.

Definition at line 8287 of file SolveLogOuterClass.java.

◆ setRepeatedField()

Builder operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.setRepeatedField	(	com.google.protobuf.Descriptors.FieldDescriptor	field,
		int	index,
		java.lang.Object	value )

Definition at line 7978 of file SolveLogOuterClass.java.

◆ setUnknownFields()

final Builder operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder.setUnknownFields ( final com.google.protobuf.UnknownFieldSet unknownFields )

Definition at line 8517 of file SolveLogOuterClass.java.

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

build/java/ortools-java/src/main/java/operations_research/pdlp/SolveLogOuterClass.java

Public Member Functions

Static Public Member Functions

Protected Member Functions

Detailed Description

Member Function Documentation

◆ addRepeatedField()

◆ build()

◆ buildPartial()

◆ clear()

◆ clearCandidateType()

◆ clearDualRayObjective()

◆ clearField()

◆ clearMaxDualRayInfeasibility()

◆ clearMaxPrimalRayInfeasibility()

◆ clearOneof()

◆ clearPrimalRayLinearObjective()

◆ clearPrimalRayQuadraticNorm()

◆ clone()

◆ getCandidateType()

◆ getDefaultInstanceForType()

◆ getDescriptor()

◆ getDescriptorForType()

◆ getDualRayObjective()

◆ getMaxDualRayInfeasibility()

◆ getMaxPrimalRayInfeasibility()

◆ getPrimalRayLinearObjective()

◆ getPrimalRayQuadraticNorm()

◆ hasCandidateType()

◆ hasDualRayObjective()

◆ hasMaxDualRayInfeasibility()

◆ hasMaxPrimalRayInfeasibility()

◆ hasPrimalRayLinearObjective()

◆ hasPrimalRayQuadraticNorm()

◆ internalGetFieldAccessorTable()

◆ isInitialized()

◆ mergeFrom() [1/3]

◆ mergeFrom() [2/3]

◆ mergeFrom() [3/3]

◆ mergeUnknownFields()

◆ setCandidateType()

◆ setDualRayObjective()

◆ setField()

◆ setMaxDualRayInfeasibility()

◆ setMaxPrimalRayInfeasibility()

◆ setPrimalRayLinearObjective()

◆ setPrimalRayQuadraticNorm()

◆ setRepeatedField()

◆ setUnknownFields()