Uses of Class
com.google.ortools.pdlp.InfeasibilityInformation.Builder

Packages that use InfeasibilityInformation.Builder

Package	Description
com.google.ortools.pdlp

Uses of InfeasibilityInformation.Builder in com.google.ortools.pdlp

Methods in com.google.ortools.pdlp that return InfeasibilityInformation.Builder

Modifier and Type	Method and Description
InfeasibilityInformation.Builder	IterationStats.Builder.addInfeasibilityInformationBuilder() A set of statistics measuring how close a point is to establishing primal or dual infeasibility (i.e., has no solution).
InfeasibilityInformation.Builder	IterationStats.Builder.addInfeasibilityInformationBuilder(int index) A set of statistics measuring how close a point is to establishing primal or dual infeasibility (i.e., has no solution).
InfeasibilityInformation.Builder	InfeasibilityInformation.Builder.clear()
InfeasibilityInformation.Builder	InfeasibilityInformation.Builder.clearCandidateType() Type of the point used to compute the InfeasibilityInformation.
InfeasibilityInformation.Builder	InfeasibilityInformation.Builder.clearDualRayObjective() The objective of the linear program labeled (1) in the previous paragraph.
InfeasibilityInformation.Builder	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.
InfeasibilityInformation.Builder	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).
InfeasibilityInformation.Builder	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.
InfeasibilityInformation.Builder	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.
InfeasibilityInformation.Builder	IterationStats.Builder.getInfeasibilityInformationBuilder(int index) A set of statistics measuring how close a point is to establishing primal or dual infeasibility (i.e., has no solution).
InfeasibilityInformation.Builder	InfeasibilityInformation.Builder.mergeFrom(com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry)
InfeasibilityInformation.Builder	InfeasibilityInformation.Builder.mergeFrom(InfeasibilityInformation other)
InfeasibilityInformation.Builder	InfeasibilityInformation.Builder.mergeFrom(com.google.protobuf.Message other)
static InfeasibilityInformation.Builder	InfeasibilityInformation.newBuilder()
static InfeasibilityInformation.Builder	InfeasibilityInformation.newBuilder(InfeasibilityInformation prototype)
InfeasibilityInformation.Builder	InfeasibilityInformation.newBuilderForType()
protected InfeasibilityInformation.Builder	InfeasibilityInformation.newBuilderForType(com.google.protobuf.AbstractMessage.BuilderParent parent)
InfeasibilityInformation.Builder	InfeasibilityInformation.Builder.setCandidateType(PointType value) Type of the point used to compute the InfeasibilityInformation.
InfeasibilityInformation.Builder	InfeasibilityInformation.Builder.setDualRayObjective(double value) The objective of the linear program labeled (1) in the previous paragraph.
InfeasibilityInformation.Builder	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.
InfeasibilityInformation.Builder	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).
InfeasibilityInformation.Builder	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.
InfeasibilityInformation.Builder	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.
InfeasibilityInformation.Builder	InfeasibilityInformation.toBuilder()

Methods in com.google.ortools.pdlp that return types with arguments of type InfeasibilityInformation.Builder

Modifier and Type	Method and Description
java.util.List<InfeasibilityInformation.Builder>	IterationStats.Builder.getInfeasibilityInformationBuilderList() A set of statistics measuring how close a point is to establishing primal or dual infeasibility (i.e., has no solution).

Methods in com.google.ortools.pdlp with parameters of type InfeasibilityInformation.Builder

Modifier and Type	Method and Description
IterationStats.Builder	IterationStats.Builder.addInfeasibilityInformation(InfeasibilityInformation.Builder builderForValue) A set of statistics measuring how close a point is to establishing primal or dual infeasibility (i.e., has no solution).
IterationStats.Builder	IterationStats.Builder.addInfeasibilityInformation(int index, InfeasibilityInformation.Builder builderForValue) A set of statistics measuring how close a point is to establishing primal or dual infeasibility (i.e., has no solution).
IterationStats.Builder	IterationStats.Builder.setInfeasibilityInformation(int index, InfeasibilityInformation.Builder builderForValue) A set of statistics measuring how close a point is to establishing primal or dual infeasibility (i.e., has no solution).