Uses of Class
com.google.ortools.pdlp.InfeasibilityInformation.Builder
Packages that use InfeasibilityInformation.Builder
-
Uses of InfeasibilityInformation.Builder in com.google.ortools.pdlp
Subclasses with type arguments of type InfeasibilityInformation.Builder in com.google.ortools.pdlpModifier and TypeClassDescriptionstatic final classInformation measuring how close a point is to establishing primal or dual infeasibility (i.e. has no solution); see also TerminationCriteria.Methods in com.google.ortools.pdlp that return InfeasibilityInformation.BuilderModifier and TypeMethodDescriptionIterationStats.Builder.addInfeasibilityInformationBuilder()A set of statistics measuring how close a point is to establishing primal or dual infeasibility (i.e., has no solution).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.clear()InfeasibilityInformation.Builder.clearCandidateType()Type of the point used to compute the InfeasibilityInformation.InfeasibilityInformation.Builder.clearDualRayObjective()The objective of the linear program labeled (1) in the previous paragraph.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.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.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.clearPrimalRayQuadraticNorm()The l_∞ norm of the vector resulting from taking the quadratic matrix from primal objective and multiplying it by the primal variables.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.mergeFrom(InfeasibilityInformation other) InfeasibilityInformation.Builder.mergeFrom(com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) InfeasibilityInformation.Builder.mergeFrom(com.google.protobuf.Message other) InfeasibilityInformation.newBuilder()InfeasibilityInformation.newBuilder(InfeasibilityInformation prototype) InfeasibilityInformation.newBuilderForType()protected InfeasibilityInformation.BuilderInfeasibilityInformation.newBuilderForType(com.google.protobuf.AbstractMessage.BuilderParent parent) InfeasibilityInformation.Builder.setCandidateType(PointType value) Type of the point used to compute the InfeasibilityInformation.InfeasibilityInformation.Builder.setDualRayObjective(double value) The objective of the linear program labeled (1) in the previous paragraph.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.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.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.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.toBuilder()Methods in com.google.ortools.pdlp that return types with arguments of type InfeasibilityInformation.BuilderModifier and TypeMethodDescriptionIterationStats.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.BuilderModifier and TypeMethodDescriptionIterationStats.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.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.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).