Google OR-Tools v9.14
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
Parameters.java
Go to the documentation of this file.
1// Generated by the protocol buffer compiler. DO NOT EDIT!
2// NO CHECKED-IN PROTOBUF GENCODE
3// source: ortools/glop/parameters.proto
4// Protobuf Java Version: 4.31.1
5
6package com.google.ortools.glop;
7
8@com.google.protobuf.Generated
9public final class Parameters {
10 private Parameters() {}
11 static {
12 com.google.protobuf.RuntimeVersion.validateProtobufGencodeVersion(
13 com.google.protobuf.RuntimeVersion.RuntimeDomain.PUBLIC,
14 /* major= */ 4,
15 /* minor= */ 31,
16 /* patch= */ 1,
17 /* suffix= */ "",
18 Parameters.class.getName());
19 }
20 public static void registerAllExtensions(
21 com.google.protobuf.ExtensionRegistryLite registry) {
22 }
23
24 public static void registerAllExtensions(
25 com.google.protobuf.ExtensionRegistry registry) {
27 (com.google.protobuf.ExtensionRegistryLite) registry);
28 }
29 static final com.google.protobuf.Descriptors.Descriptor
30 internal_static_operations_research_glop_GlopParameters_descriptor;
31 static final
32 com.google.protobuf.GeneratedMessage.FieldAccessorTable
33 internal_static_operations_research_glop_GlopParameters_fieldAccessorTable;
34
35 public static com.google.protobuf.Descriptors.FileDescriptor
37 return descriptor;
38 }
39 private static com.google.protobuf.Descriptors.FileDescriptor
40 descriptor;
41 static {
42 java.lang.String[] descriptorData = {
43 "\n\035ortools/glop/parameters.proto\022\030operati" +
44 "ons_research.glop\"\360\030\n\016GlopParameters\022`\n\016" +
45 "scaling_method\0309 \001(\01629.operations_resear" +
46 "ch.glop.GlopParameters.ScalingAlgorithm:" +
47 "\rEQUILIBRATION\022]\n\020feasibility_rule\030\001 \001(\016" +
48 "24.operations_research.glop.GlopParamete" +
49 "rs.PricingRule:\rSTEEPEST_EDGE\022^\n\021optimiz" +
50 "ation_rule\030\002 \001(\01624.operations_research.g" +
51 "lop.GlopParameters.PricingRule:\rSTEEPEST" +
52 "_EDGE\022(\n\031refactorization_threshold\030\006 \001(\001" +
53 ":\0051e-09\0220\n!recompute_reduced_costs_thres" +
54 "hold\030\010 \001(\001:\0051e-08\022+\n\036recompute_edges_nor" +
55 "m_threshold\030\t \001(\001:\003100\022+\n\034primal_feasibi" +
56 "lity_tolerance\030\n \001(\001:\0051e-08\022)\n\032dual_feas" +
57 "ibility_tolerance\030\013 \001(\001:\0051e-08\022(\n\031ratio_" +
58 "test_zero_threshold\030\014 \001(\001:\0051e-09\022#\n\026harr" +
59 "is_tolerance_ratio\030\r \001(\001:\0030.5\022$\n\025small_p" +
60 "ivot_threshold\030\016 \001(\001:\0051e-06\022\'\n\030minimum_a" +
61 "cceptable_pivot\030\017 \001(\001:\0051e-06\022\035\n\016drop_tol" +
62 "erance\0304 \001(\001:\0051e-14\022\031\n\013use_scaling\030\020 \001(\010" +
63 ":\004true\022m\n\014cost_scaling\030< \001(\0162=.operation" +
64 "s_research.glop.GlopParameters.CostScali" +
65 "ngAlgorithm:\030CONTAIN_ONE_COST_SCALING\022a\n" +
66 "\rinitial_basis\030\021 \001(\0162>.operations_resear" +
67 "ch.glop.GlopParameters.InitialBasisHeuri" +
68 "stic:\nTRIANGULAR\022#\n\025use_transposed_matri" +
69 "x\030\022 \001(\010:\004true\022(\n\034basis_refactorization_p" +
70 "eriod\030\023 \001(\005:\00264\0227\n)dynamically_adjust_re" +
71 "factorization_period\030? \001(\010:\004true\022f\n\022solv" +
72 "e_dual_problem\030\024 \001(\01627.operations_resear" +
73 "ch.glop.GlopParameters.SolverBehavior:\021L" +
74 "ET_SOLVER_DECIDE\022\037\n\022dualizer_threshold\030\025" +
75 " \001(\001:\0031.5\022-\n\036solution_feasibility_tolera" +
76 "nce\030\026 \001(\001:\0051e-06\022.\n provide_strong_optim" +
77 "al_guarantee\030\030 \001(\010:\004true\022(\n\032change_statu" +
78 "s_to_imprecise\030: \001(\010:\004true\022)\n\035max_number" +
79 "_of_reoptimizations\0308 \001(\001:\00240\022.\n lu_fact" +
80 "orization_pivot_threshold\030\031 \001(\001:\0040.01\022 \n" +
81 "\023max_time_in_seconds\030\032 \001(\001:\003inf\022#\n\026max_d" +
82 "eterministic_time\030- \001(\001:\003inf\022$\n\030max_numb" +
83 "er_of_iterations\030\033 \001(\003:\002-1\022%\n\032markowitz_" +
84 "zlatev_parameter\030\035 \001(\005:\0013\022.\n\037markowitz_s" +
85 "ingularity_threshold\030\036 \001(\001:\0051e-15\022\037\n\020use" +
86 "_dual_simplex\030\037 \001(\010:\005false\022-\n\036allow_simp" +
87 "lex_algorithm_change\030 \001(\010:\005false\022\'\n\032dev" +
88 "ex_weights_reset_period\030! \001(\005:\003150\022\037\n\021us" +
89 "e_preprocessing\030\" \001(\010:\004true\022,\n\036use_middl" +
90 "e_product_form_update\030# \001(\010:\004true\0220\n\"ini" +
91 "tialize_devex_with_column_norms\030$ \001(\010:\004t" +
92 "rue\0227\n)exploit_singleton_column_in_initi" +
93 "al_basis\030% \001(\010:\004true\022*\n\032dual_small_pivot" +
94 "_threshold\030& \001(\001:\0060.0001\022*\n\033preprocessor" +
95 "_zero_tolerance\030\' \001(\001:\0051e-09\022#\n\025objectiv" +
96 "e_lower_limit\030( \001(\001:\004-inf\022\"\n\025objective_u" +
97 "pper_limit\030) \001(\001:\003inf\022(\n\032degenerate_mini" +
98 "step_factor\030* \001(\001:\0040.01\022\026\n\013random_seed\030+" +
99 " \001(\005:\0011\022\036\n\017use_absl_random\030H \001(\010:\005false\022" +
100 "\032\n\017num_omp_threads\030, \001(\005:\0011\022,\n\035perturb_c" +
101 "osts_in_dual_simplex\0305 \001(\010:\005false\0226\n(use" +
102 "_dedicated_dual_feasibility_algorithm\030> " +
103 "\001(\010:\004true\022)\n\032relative_cost_perturbation\030" +
104 "6 \001(\001:\0051e-05\022-\n\036relative_max_cost_pertur" +
105 "bation\0307 \001(\001:\0051e-07\0221\n\"initial_condition" +
106 "_number_threshold\030; \001(\001:\0051e+50\022\"\n\023log_se" +
107 "arch_progress\030= \001(\010:\005false\022\033\n\rlog_to_std" +
108 "out\030B \001(\010:\004true\022.\n!crossover_bound_snapp" +
109 "ing_distance\030@ \001(\001:\003inf\022\034\n\016push_to_verte" +
110 "x\030A \001(\010:\004true\022+\n\035use_implied_free_prepro" +
111 "cessor\030C \001(\010:\004true\022\"\n\023max_valid_magnitud" +
112 "e\030F \001(\001:\0051e+30\022\035\n\016drop_magnitude\030G \001(\001:\005" +
113 "1e-30\022)\n\032dual_price_prioritize_norm\030E \001(" +
114 "\010:\005false\"F\n\020ScalingAlgorithm\022\013\n\007DEFAULT\020" +
115 "\000\022\021\n\rEQUILIBRATION\020\001\022\022\n\016LINEAR_PROGRAM\020\002" +
116 "\"D\n\016SolverBehavior\022\r\n\tALWAYS_DO\020\000\022\014\n\010NEV" +
117 "ER_DO\020\001\022\025\n\021LET_SOLVER_DECIDE\020\002\"8\n\013Pricin" +
118 "gRule\022\013\n\007DANTZIG\020\000\022\021\n\rSTEEPEST_EDGE\020\001\022\t\n" +
119 "\005DEVEX\020\002\"G\n\025InitialBasisHeuristic\022\010\n\004NON" +
120 "E\020\000\022\t\n\005BIXBY\020\001\022\016\n\nTRIANGULAR\020\002\022\t\n\005MAROS\020" +
121 "\003\"y\n\024CostScalingAlgorithm\022\023\n\017NO_COST_SCA" +
122 "LING\020\000\022\034\n\030CONTAIN_ONE_COST_SCALING\020\001\022\025\n\021" +
123 "MEAN_COST_SCALING\020\002\022\027\n\023MEDIAN_COST_SCALI" +
124 "NG\020\003B1\n\027com.google.ortools.glopP\001\252\002\023Goog" +
125 "le.OrTools.Glop"
126 };
127 descriptor = com.google.protobuf.Descriptors.FileDescriptor
128 .internalBuildGeneratedFileFrom(descriptorData,
129 new com.google.protobuf.Descriptors.FileDescriptor[] {
130 });
131 internal_static_operations_research_glop_GlopParameters_descriptor =
132 getDescriptor().getMessageTypes().get(0);
133 internal_static_operations_research_glop_GlopParameters_fieldAccessorTable = new
134 com.google.protobuf.GeneratedMessage.FieldAccessorTable(
135 internal_static_operations_research_glop_GlopParameters_descriptor,
136 new java.lang.String[] { "ScalingMethod", "FeasibilityRule", "OptimizationRule", "RefactorizationThreshold", "RecomputeReducedCostsThreshold", "RecomputeEdgesNormThreshold", "PrimalFeasibilityTolerance", "DualFeasibilityTolerance", "RatioTestZeroThreshold", "HarrisToleranceRatio", "SmallPivotThreshold", "MinimumAcceptablePivot", "DropTolerance", "UseScaling", "CostScaling", "InitialBasis", "UseTransposedMatrix", "BasisRefactorizationPeriod", "DynamicallyAdjustRefactorizationPeriod", "SolveDualProblem", "DualizerThreshold", "SolutionFeasibilityTolerance", "ProvideStrongOptimalGuarantee", "ChangeStatusToImprecise", "MaxNumberOfReoptimizations", "LuFactorizationPivotThreshold", "MaxTimeInSeconds", "MaxDeterministicTime", "MaxNumberOfIterations", "MarkowitzZlatevParameter", "MarkowitzSingularityThreshold", "UseDualSimplex", "AllowSimplexAlgorithmChange", "DevexWeightsResetPeriod", "UsePreprocessing", "UseMiddleProductFormUpdate", "InitializeDevexWithColumnNorms", "ExploitSingletonColumnInInitialBasis", "DualSmallPivotThreshold", "PreprocessorZeroTolerance", "ObjectiveLowerLimit", "ObjectiveUpperLimit", "DegenerateMinistepFactor", "RandomSeed", "UseAbslRandom", "NumOmpThreads", "PerturbCostsInDualSimplex", "UseDedicatedDualFeasibilityAlgorithm", "RelativeCostPerturbation", "RelativeMaxCostPerturbation", "InitialConditionNumberThreshold", "LogSearchProgress", "LogToStdout", "CrossoverBoundSnappingDistance", "PushToVertex", "UseImpliedFreePreprocessor", "MaxValidMagnitude", "DropMagnitude", "DualPricePrioritizeNorm", });
137 descriptor.resolveAllFeaturesImmutable();
138 }
139
140 // @@protoc_insertion_point(outer_class_scope)
141}
static void registerAllExtensions(com.google.protobuf.ExtensionRegistry registry)
static com.google.protobuf.Descriptors.FileDescriptor getDescriptor()
static void registerAllExtensions(com.google.protobuf.ExtensionRegistryLite registry)