Google OR-Tools v9.9
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// source: ortools/glop/parameters.proto
3
4// Protobuf Java Version: 3.25.3
5package com.google.ortools.glop;
6
7public final class Parameters {
8 private Parameters() {}
9 public static void registerAllExtensions(
10 com.google.protobuf.ExtensionRegistryLite registry) {
11 }
12
13 public static void registerAllExtensions(
14 com.google.protobuf.ExtensionRegistry registry) {
16 (com.google.protobuf.ExtensionRegistryLite) registry);
17 }
18 static final com.google.protobuf.Descriptors.Descriptor
19 internal_static_operations_research_glop_GlopParameters_descriptor;
20 static final
21 com.google.protobuf.GeneratedMessageV3.FieldAccessorTable
22 internal_static_operations_research_glop_GlopParameters_fieldAccessorTable;
23
24 public static com.google.protobuf.Descriptors.FileDescriptor
26 return descriptor;
27 }
28 private static com.google.protobuf.Descriptors.FileDescriptor
29 descriptor;
30 static {
31 java.lang.String[] descriptorData = {
32 "\n\035ortools/glop/parameters.proto\022\030operati" +
33 "ons_research.glop\"\320\030\n\016GlopParameters\022`\n\016" +
34 "scaling_method\0309 \001(\01629.operations_resear" +
35 "ch.glop.GlopParameters.ScalingAlgorithm:" +
36 "\rEQUILIBRATION\022]\n\020feasibility_rule\030\001 \001(\016" +
37 "24.operations_research.glop.GlopParamete" +
38 "rs.PricingRule:\rSTEEPEST_EDGE\022^\n\021optimiz" +
39 "ation_rule\030\002 \001(\01624.operations_research.g" +
40 "lop.GlopParameters.PricingRule:\rSTEEPEST" +
41 "_EDGE\022(\n\031refactorization_threshold\030\006 \001(\001" +
42 ":\0051e-09\0220\n!recompute_reduced_costs_thres" +
43 "hold\030\010 \001(\001:\0051e-08\022+\n\036recompute_edges_nor" +
44 "m_threshold\030\t \001(\001:\003100\022+\n\034primal_feasibi" +
45 "lity_tolerance\030\n \001(\001:\0051e-08\022)\n\032dual_feas" +
46 "ibility_tolerance\030\013 \001(\001:\0051e-08\022(\n\031ratio_" +
47 "test_zero_threshold\030\014 \001(\001:\0051e-09\022#\n\026harr" +
48 "is_tolerance_ratio\030\r \001(\001:\0030.5\022$\n\025small_p" +
49 "ivot_threshold\030\016 \001(\001:\0051e-06\022\'\n\030minimum_a" +
50 "cceptable_pivot\030\017 \001(\001:\0051e-06\022\035\n\016drop_tol" +
51 "erance\0304 \001(\001:\0051e-14\022\031\n\013use_scaling\030\020 \001(\010" +
52 ":\004true\022m\n\014cost_scaling\030< \001(\0162=.operation" +
53 "s_research.glop.GlopParameters.CostScali" +
54 "ngAlgorithm:\030CONTAIN_ONE_COST_SCALING\022a\n" +
55 "\rinitial_basis\030\021 \001(\0162>.operations_resear" +
56 "ch.glop.GlopParameters.InitialBasisHeuri" +
57 "stic:\nTRIANGULAR\022#\n\025use_transposed_matri" +
58 "x\030\022 \001(\010:\004true\022(\n\034basis_refactorization_p" +
59 "eriod\030\023 \001(\005:\00264\0227\n)dynamically_adjust_re" +
60 "factorization_period\030? \001(\010:\004true\022f\n\022solv" +
61 "e_dual_problem\030\024 \001(\01627.operations_resear" +
62 "ch.glop.GlopParameters.SolverBehavior:\021L" +
63 "ET_SOLVER_DECIDE\022\037\n\022dualizer_threshold\030\025" +
64 " \001(\001:\0031.5\022-\n\036solution_feasibility_tolera" +
65 "nce\030\026 \001(\001:\0051e-06\022.\n provide_strong_optim" +
66 "al_guarantee\030\030 \001(\010:\004true\022(\n\032change_statu" +
67 "s_to_imprecise\030: \001(\010:\004true\022)\n\035max_number" +
68 "_of_reoptimizations\0308 \001(\001:\00240\022.\n lu_fact" +
69 "orization_pivot_threshold\030\031 \001(\001:\0040.01\022 \n" +
70 "\023max_time_in_seconds\030\032 \001(\001:\003inf\022#\n\026max_d" +
71 "eterministic_time\030- \001(\001:\003inf\022$\n\030max_numb" +
72 "er_of_iterations\030\033 \001(\003:\002-1\022%\n\032markowitz_" +
73 "zlatev_parameter\030\035 \001(\005:\0013\022.\n\037markowitz_s" +
74 "ingularity_threshold\030\036 \001(\001:\0051e-15\022\037\n\020use" +
75 "_dual_simplex\030\037 \001(\010:\005false\022-\n\036allow_simp" +
76 "lex_algorithm_change\030 \001(\010:\005false\022\'\n\032dev" +
77 "ex_weights_reset_period\030! \001(\005:\003150\022\037\n\021us" +
78 "e_preprocessing\030\" \001(\010:\004true\022,\n\036use_middl" +
79 "e_product_form_update\030# \001(\010:\004true\0220\n\"ini" +
80 "tialize_devex_with_column_norms\030$ \001(\010:\004t" +
81 "rue\0227\n)exploit_singleton_column_in_initi" +
82 "al_basis\030% \001(\010:\004true\022*\n\032dual_small_pivot" +
83 "_threshold\030& \001(\001:\0060.0001\022*\n\033preprocessor" +
84 "_zero_tolerance\030\' \001(\001:\0051e-09\022#\n\025objectiv" +
85 "e_lower_limit\030( \001(\001:\004-inf\022\"\n\025objective_u" +
86 "pper_limit\030) \001(\001:\003inf\022(\n\032degenerate_mini" +
87 "step_factor\030* \001(\001:\0040.01\022\026\n\013random_seed\030+" +
88 " \001(\005:\0011\022\032\n\017num_omp_threads\030, \001(\005:\0011\022,\n\035p" +
89 "erturb_costs_in_dual_simplex\0305 \001(\010:\005fals" +
90 "e\0226\n(use_dedicated_dual_feasibility_algo" +
91 "rithm\030> \001(\010:\004true\022)\n\032relative_cost_pertu" +
92 "rbation\0306 \001(\001:\0051e-05\022-\n\036relative_max_cos" +
93 "t_perturbation\0307 \001(\001:\0051e-07\0221\n\"initial_c" +
94 "ondition_number_threshold\030; \001(\001:\0051e+50\022\"" +
95 "\n\023log_search_progress\030= \001(\010:\005false\022\033\n\rlo" +
96 "g_to_stdout\030B \001(\010:\004true\022.\n!crossover_bou" +
97 "nd_snapping_distance\030@ \001(\001:\003inf\022\034\n\016push_" +
98 "to_vertex\030A \001(\010:\004true\022+\n\035use_implied_fre" +
99 "e_preprocessor\030C \001(\010:\004true\022\"\n\023max_valid_" +
100 "magnitude\030F \001(\001:\0051e+30\022\035\n\016drop_magnitude" +
101 "\030G \001(\001:\0051e-30\022)\n\032dual_price_prioritize_n" +
102 "orm\030E \001(\010:\005false\"F\n\020ScalingAlgorithm\022\013\n\007" +
103 "DEFAULT\020\000\022\021\n\rEQUILIBRATION\020\001\022\022\n\016LINEAR_P" +
104 "ROGRAM\020\002\"D\n\016SolverBehavior\022\r\n\tALWAYS_DO\020" +
105 "\000\022\014\n\010NEVER_DO\020\001\022\025\n\021LET_SOLVER_DECIDE\020\002\"8" +
106 "\n\013PricingRule\022\013\n\007DANTZIG\020\000\022\021\n\rSTEEPEST_E" +
107 "DGE\020\001\022\t\n\005DEVEX\020\002\"G\n\025InitialBasisHeuristi" +
108 "c\022\010\n\004NONE\020\000\022\t\n\005BIXBY\020\001\022\016\n\nTRIANGULAR\020\002\022\t" +
109 "\n\005MAROS\020\003\"y\n\024CostScalingAlgorithm\022\023\n\017NO_" +
110 "COST_SCALING\020\000\022\034\n\030CONTAIN_ONE_COST_SCALI" +
111 "NG\020\001\022\025\n\021MEAN_COST_SCALING\020\002\022\027\n\023MEDIAN_CO" +
112 "ST_SCALING\020\003B1\n\027com.google.ortools.glopP" +
113 "\001\252\002\023Google.OrTools.Glop"
114 };
115 descriptor = com.google.protobuf.Descriptors.FileDescriptor
116 .internalBuildGeneratedFileFrom(descriptorData,
117 new com.google.protobuf.Descriptors.FileDescriptor[] {
118 });
119 internal_static_operations_research_glop_GlopParameters_descriptor =
120 getDescriptor().getMessageTypes().get(0);
121 internal_static_operations_research_glop_GlopParameters_fieldAccessorTable = new
122 com.google.protobuf.GeneratedMessageV3.FieldAccessorTable(
123 internal_static_operations_research_glop_GlopParameters_descriptor,
124 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", "NumOmpThreads", "PerturbCostsInDualSimplex", "UseDedicatedDualFeasibilityAlgorithm", "RelativeCostPerturbation", "RelativeMaxCostPerturbation", "InitialConditionNumberThreshold", "LogSearchProgress", "LogToStdout", "CrossoverBoundSnappingDistance", "PushToVertex", "UseImpliedFreePreprocessor", "MaxValidMagnitude", "DropMagnitude", "DualPricePrioritizeNorm", });
125 }
126
127 // @@protoc_insertion_point(outer_class_scope)
128}
static void registerAllExtensions(com.google.protobuf.ExtensionRegistry registry)
static com.google.protobuf.Descriptors.FileDescriptor getDescriptor()
static void registerAllExtensions(com.google.protobuf.ExtensionRegistryLite registry)