Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
Information measuring how close a point is to establishing primal or dual infeasibility (i.e. has no solution); see also TerminationCriteria. More...
Public Member Functions | |
InfeasibilityInformation () | |
InfeasibilityInformation (InfeasibilityInformation other) | |
InfeasibilityInformation | Clone () |
void | ClearMaxPrimalRayInfeasibility () |
Clears the value of the "max_primal_ray_infeasibility" field. | |
void | ClearPrimalRayLinearObjective () |
Clears the value of the "primal_ray_linear_objective" field. | |
void | ClearPrimalRayQuadraticNorm () |
Clears the value of the "primal_ray_quadratic_norm" field. | |
void | ClearMaxDualRayInfeasibility () |
Clears the value of the "max_dual_ray_infeasibility" field. | |
void | ClearDualRayObjective () |
Clears the value of the "dual_ray_objective" field. | |
void | ClearCandidateType () |
Clears the value of the "candidate_type" field. | |
override bool | Equals (object other) |
bool | Equals (InfeasibilityInformation other) |
override int | GetHashCode () |
override string | ToString () |
void | WriteTo (pb::CodedOutputStream output) |
int | CalculateSize () |
void | MergeFrom (InfeasibilityInformation other) |
void | MergeFrom (pb::CodedInputStream input) |
Static Public Attributes | |
const int | MaxPrimalRayInfeasibilityFieldNumber = 1 |
Field number for the "max_primal_ray_infeasibility" field. | |
const int | PrimalRayLinearObjectiveFieldNumber = 2 |
Field number for the "primal_ray_linear_objective" field. | |
const int | PrimalRayQuadraticNormFieldNumber = 3 |
Field number for the "primal_ray_quadratic_norm" field. | |
const int | MaxDualRayInfeasibilityFieldNumber = 4 |
Field number for the "max_dual_ray_infeasibility" field. | |
const int | DualRayObjectiveFieldNumber = 5 |
Field number for the "dual_ray_objective" field. | |
const int | CandidateTypeFieldNumber = 6 |
Field number for the "candidate_type" field. | |
Properties | |
static pb::MessageParser< InfeasibilityInformation > | Parser [get] |
static pbr::MessageDescriptor | Descriptor [get] |
double | MaxPrimalRayInfeasibility [get, set] |
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. | |
bool | HasMaxPrimalRayInfeasibility [get] |
Gets whether the "max_primal_ray_infeasibility" field is set. | |
double | PrimalRayLinearObjective [get, set] |
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. | |
bool | HasPrimalRayLinearObjective [get] |
Gets whether the "primal_ray_linear_objective" field is set. | |
double | PrimalRayQuadraticNorm [get, set] |
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. | |
bool | HasPrimalRayQuadraticNorm [get] |
Gets whether the "primal_ray_quadratic_norm" field is set. | |
double | MaxDualRayInfeasibility [get, set] |
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. | |
bool | HasMaxDualRayInfeasibility [get] |
Gets whether the "max_dual_ray_infeasibility" field is set. | |
double | DualRayObjective [get, set] |
The objective of the linear program labeled (1) in the previous paragraph. | |
bool | HasDualRayObjective [get] |
Gets whether the "dual_ray_objective" field is set. | |
global::Google.OrTools.PDLP.PointType | CandidateType [get, set] |
Type of the point used to compute the InfeasibilityInformation. | |
bool | HasCandidateType [get] |
Gets whether the "candidate_type" field is set. | |
Information measuring how close a point is to establishing primal or dual infeasibility (i.e. has no solution); see also TerminationCriteria.
Definition at line 3039 of file SolveLog.pb.cs.
|
inline |
Definition at line 3065 of file SolveLog.pb.cs.
|
inline |
Definition at line 3073 of file SolveLog.pb.cs.
|
inline |
Definition at line 3408 of file SolveLog.pb.cs.
|
inline |
Clears the value of the "candidate_type" field.
Definition at line 3286 of file SolveLog.pb.cs.
|
inline |
Clears the value of the "dual_ray_objective" field.
Definition at line 3256 of file SolveLog.pb.cs.
|
inline |
Clears the value of the "max_dual_ray_infeasibility" field.
Definition at line 3226 of file SolveLog.pb.cs.
|
inline |
Clears the value of the "max_primal_ray_infeasibility" field.
Definition at line 3123 of file SolveLog.pb.cs.
|
inline |
Clears the value of the "primal_ray_linear_objective" field.
Definition at line 3155 of file SolveLog.pb.cs.
|
inline |
Clears the value of the "primal_ray_quadratic_norm" field.
Definition at line 3187 of file SolveLog.pb.cs.
|
inline |
Definition at line 3086 of file SolveLog.pb.cs.
|
inline |
Definition at line 3298 of file SolveLog.pb.cs.
|
inline |
Definition at line 3292 of file SolveLog.pb.cs.
|
inline |
Definition at line 3316 of file SolveLog.pb.cs.
|
inline |
Definition at line 3436 of file SolveLog.pb.cs.
|
inline |
Definition at line 3463 of file SolveLog.pb.cs.
|
inline |
Definition at line 3332 of file SolveLog.pb.cs.
|
inline |
Definition at line 3338 of file SolveLog.pb.cs.
|
static |
Field number for the "candidate_type" field.
Definition at line 3261 of file SolveLog.pb.cs.
|
static |
Field number for the "dual_ray_objective" field.
Definition at line 3231 of file SolveLog.pb.cs.
|
static |
Field number for the "max_dual_ray_infeasibility" field.
Definition at line 3192 of file SolveLog.pb.cs.
|
static |
Field number for the "max_primal_ray_infeasibility" field.
Definition at line 3091 of file SolveLog.pb.cs.
|
static |
Field number for the "primal_ray_linear_objective" field.
Definition at line 3128 of file SolveLog.pb.cs.
|
static |
Field number for the "primal_ray_quadratic_norm" field.
Definition at line 3160 of file SolveLog.pb.cs.
|
getset |
Type of the point used to compute the InfeasibilityInformation.
Definition at line 3270 of file SolveLog.pb.cs.
|
staticget |
Definition at line 3053 of file SolveLog.pb.cs.
|
getset |
The objective of the linear program labeled (1) in the previous paragraph.
Definition at line 3240 of file SolveLog.pb.cs.
|
get |
Gets whether the "candidate_type" field is set.
Definition at line 3280 of file SolveLog.pb.cs.
|
get |
Gets whether the "dual_ray_objective" field is set.
Definition at line 3250 of file SolveLog.pb.cs.
|
get |
Gets whether the "max_dual_ray_infeasibility" field is set.
Definition at line 3220 of file SolveLog.pb.cs.
|
get |
Gets whether the "max_primal_ray_infeasibility" field is set.
Definition at line 3117 of file SolveLog.pb.cs.
|
get |
Gets whether the "primal_ray_linear_objective" field is set.
Definition at line 3149 of file SolveLog.pb.cs.
|
get |
Gets whether the "primal_ray_quadratic_norm" field is set.
Definition at line 3181 of file SolveLog.pb.cs.
|
getset |
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.
Definition at line 3210 of file SolveLog.pb.cs.
|
getset |
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.
Definition at line 3107 of file SolveLog.pb.cs.
|
staticget |
Definition at line 3049 of file SolveLog.pb.cs.
|
getset |
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.
Definition at line 3139 of file SolveLog.pb.cs.
|
getset |
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.
Definition at line 3171 of file SolveLog.pb.cs.