Package operations_research.pdlp

Class SolveLogOuterClass.InfeasibilityInformation.Builder

    • Method Detail

      • getDescriptor

        public static final com.google.protobuf.Descriptors.Descriptor getDescriptor()

      • internalGetFieldAccessorTable

        protected com.google.protobuf.GeneratedMessageV3.FieldAccessorTable internalGetFieldAccessorTable()
        Specified by:
        internalGetFieldAccessorTable in class com.google.protobuf.GeneratedMessageV3.Builder<SolveLogOuterClass.InfeasibilityInformation.Builder>

      • getDescriptorForType

        public com.google.protobuf.Descriptors.Descriptor getDescriptorForType()
        Specified by:
        getDescriptorForType in interface com.google.protobuf.Message.Builder
        Specified by:
        getDescriptorForType in interface com.google.protobuf.MessageOrBuilder
        Overrides:
        getDescriptorForType in class com.google.protobuf.GeneratedMessageV3.Builder<SolveLogOuterClass.InfeasibilityInformation.Builder>

      • getDefaultInstanceForType

        public SolveLogOuterClass.InfeasibilityInformation getDefaultInstanceForType()
        Specified by:
        getDefaultInstanceForType in interface com.google.protobuf.MessageLiteOrBuilder
        Specified by:
        getDefaultInstanceForType in interface com.google.protobuf.MessageOrBuilder

      • buildPartial

        public SolveLogOuterClass.InfeasibilityInformation buildPartial()
        Specified by:
        buildPartial in interface com.google.protobuf.Message.Builder
        Specified by:
        buildPartial in interface com.google.protobuf.MessageLite.Builder

      • isInitialized

        public final boolean isInitialized()
        Specified by:
        isInitialized in interface com.google.protobuf.MessageLiteOrBuilder
        Overrides:
        isInitialized in class com.google.protobuf.GeneratedMessageV3.Builder<SolveLogOuterClass.InfeasibilityInformation.Builder>

      • mergeFrom

        public SolveLogOuterClass.InfeasibilityInformation.Builder mergeFrom​(com.google.protobuf.CodedInputStream input,
                                                                     com.google.protobuf.ExtensionRegistryLite extensionRegistry)
                                                              throws java.io.IOException
        Specified by:
        mergeFrom in interface com.google.protobuf.Message.Builder
        Specified by:
        mergeFrom in interface com.google.protobuf.MessageLite.Builder
        Overrides:
        mergeFrom in class com.google.protobuf.AbstractMessage.Builder<SolveLogOuterClass.InfeasibilityInformation.Builder>
        Throws:
        java.io.IOException

      • hasMaxPrimalRayInfeasibility

        public boolean hasMaxPrimalRayInfeasibility()
         Let x_ray be the algorithm's estimate of the primal extreme ray where x_ray
 is a vector scaled such that its infinity norm is one. A simple and typical
 choice of x_ray is x_ray = x / | x |_∞ where x is the current primal
 iterate. For this value compute the maximum absolute error in the primal
 linear program with the right hand side and finite variable bounds set to
 zero. This error refers to both the linear constraints and sign constraints
 on the ray.
        optional double max_primal_ray_infeasibility = 1;
        Specified by:
        hasMaxPrimalRayInfeasibility in interface SolveLogOuterClass.InfeasibilityInformationOrBuilder
        Returns:
        Whether the maxPrimalRayInfeasibility field is set.

      • getMaxPrimalRayInfeasibility

        public double getMaxPrimalRayInfeasibility()
         Let x_ray be the algorithm's estimate of the primal extreme ray where x_ray
 is a vector scaled such that its infinity norm is one. A simple and typical
 choice of x_ray is x_ray = x / | x |_∞ where x is the current primal
 iterate. For this value compute the maximum absolute error in the primal
 linear program with the right hand side and finite variable bounds set to
 zero. This error refers to both the linear constraints and sign constraints
 on the ray.
        optional double max_primal_ray_infeasibility = 1;
        Specified by:
        getMaxPrimalRayInfeasibility in interface SolveLogOuterClass.InfeasibilityInformationOrBuilder
        Returns:
        The maxPrimalRayInfeasibility.

      • setMaxPrimalRayInfeasibility

        public 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 scaled such that its infinity norm is one. A simple and typical
 choice of x_ray is x_ray = x / | x |_∞ where x is the current primal
 iterate. For this value compute the maximum absolute error in the primal
 linear program with the right hand side and finite variable bounds set to
 zero. This error refers to both the linear constraints and sign constraints
 on the ray.
        optional double max_primal_ray_infeasibility = 1;
        Parameters:
        value - The maxPrimalRayInfeasibility to set.
        Returns:
        This builder for chaining.

      • clearMaxPrimalRayInfeasibility

        public SolveLogOuterClass.InfeasibilityInformation.Builder clearMaxPrimalRayInfeasibility()
         Let x_ray be the algorithm's estimate of the primal extreme ray where x_ray
 is a vector scaled such that its infinity norm is one. A simple and typical
 choice of x_ray is x_ray = x / | x |_∞ where x is the current primal
 iterate. For this value compute the maximum absolute error in the primal
 linear program with the right hand side and finite variable bounds set to
 zero. This error refers to both the linear constraints and sign constraints
 on the ray.
        optional double max_primal_ray_infeasibility = 1;
        Returns:
        This builder for chaining.

      • hasPrimalRayLinearObjective

        public boolean 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;
        Specified by:
        hasPrimalRayLinearObjective in interface SolveLogOuterClass.InfeasibilityInformationOrBuilder
        Returns:
        Whether the primalRayLinearObjective field is set.

      • getPrimalRayLinearObjective

        public double 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;
        Specified by:
        getPrimalRayLinearObjective in interface SolveLogOuterClass.InfeasibilityInformationOrBuilder
        Returns:
        The primalRayLinearObjective.

      • setPrimalRayLinearObjective

        public 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.

      • clearPrimalRayLinearObjective

        public 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.

      • hasPrimalRayQuadraticNorm

        public boolean 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;
        Specified by:
        hasPrimalRayQuadraticNorm in interface SolveLogOuterClass.InfeasibilityInformationOrBuilder
        Returns:
        Whether the primalRayQuadraticNorm field is set.

      • getPrimalRayQuadraticNorm

        public double 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;
        Specified by:
        getPrimalRayQuadraticNorm in interface SolveLogOuterClass.InfeasibilityInformationOrBuilder
        Returns:
        The primalRayQuadraticNorm.

      • setPrimalRayQuadraticNorm

        public 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.

      • clearPrimalRayQuadraticNorm

        public 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.

      • hasMaxDualRayInfeasibility

        public boolean 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 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;
        Specified by:
        hasMaxDualRayInfeasibility in interface SolveLogOuterClass.InfeasibilityInformationOrBuilder
        Returns:
        Whether the maxDualRayInfeasibility field is set.

      • getMaxDualRayInfeasibility

        public double 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 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;
        Specified by:
        getMaxDualRayInfeasibility in interface SolveLogOuterClass.InfeasibilityInformationOrBuilder
        Returns:
        The maxDualRayInfeasibility.

      • setMaxDualRayInfeasibility

        public 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 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.

      • clearMaxDualRayInfeasibility

        public 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 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.

      • setDualRayObjective

        public 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.

      • clearDualRayObjective

        public 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.

      • clearCandidateType

        public 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.