4#ifndef GOOGLE_PROTOBUF_INCLUDED_ortools_2fglop_2fparameters_2eproto
5#define GOOGLE_PROTOBUF_INCLUDED_ortools_2fglop_2fparameters_2eproto
10#include <google/protobuf/port_def.inc>
11#if PROTOBUF_VERSION < 3018000
12#error This file was generated by a newer version of protoc which is
13#error incompatible with your Protocol Buffer headers. Please update
16#if 3018000 < PROTOBUF_MIN_PROTOC_VERSION
17#error This file was generated by an older version of protoc which is
18#error incompatible with your Protocol Buffer headers. Please
19#error regenerate this file with a newer version of protoc.
22#include <google/protobuf/port_undef.inc>
23#include <google/protobuf/io/coded_stream.h>
24#include <google/protobuf/arena.h>
25#include <google/protobuf/arenastring.h>
26#include <google/protobuf/generated_message_table_driven.h>
27#include <google/protobuf/generated_message_util.h>
28#include <google/protobuf/metadata_lite.h>
29#include <google/protobuf/generated_message_reflection.h>
30#include <google/protobuf/message.h>
31#include <google/protobuf/repeated_field.h>
32#include <google/protobuf/extension_set.h>
33#include <google/protobuf/generated_enum_reflection.h>
34#include <google/protobuf/unknown_field_set.h>
36#include <google/protobuf/port_def.inc>
37#define PROTOBUF_INTERNAL_EXPORT_ortools_2fglop_2fparameters_2eproto
38PROTOBUF_NAMESPACE_OPEN
42PROTOBUF_NAMESPACE_CLOSE
46 static const ::PROTOBUF_NAMESPACE_ID::internal::ParseTableField entries[]
48 static const ::PROTOBUF_NAMESPACE_ID::internal::AuxiliaryParseTableField aux[]
50 static const ::PROTOBUF_NAMESPACE_ID::internal::ParseTable schema[1]
52 static const ::PROTOBUF_NAMESPACE_ID::internal::FieldMetadata
field_metadata[];
54 static const ::PROTOBUF_NAMESPACE_ID::uint32
offsets[];
60struct GlopParametersDefaultTypeInternal;
64PROTOBUF_NAMESPACE_OPEN
66PROTOBUF_NAMESPACE_CLOSE
85 "Incorrect type passed to function GlopParameters_ScalingAlgorithm_Name.");
86 return ::PROTOBUF_NAMESPACE_ID::internal::NameOfEnum(
91 return ::PROTOBUF_NAMESPACE_ID::internal::ParseNamedEnum<GlopParameters_ScalingAlgorithm>(
109 "Incorrect type passed to function GlopParameters_SolverBehavior_Name.");
110 return ::PROTOBUF_NAMESPACE_ID::internal::NameOfEnum(
115 return ::PROTOBUF_NAMESPACE_ID::internal::ParseNamedEnum<GlopParameters_SolverBehavior>(
133 "Incorrect type passed to function GlopParameters_PricingRule_Name.");
134 return ::PROTOBUF_NAMESPACE_ID::internal::NameOfEnum(
139 return ::PROTOBUF_NAMESPACE_ID::internal::ParseNamedEnum<GlopParameters_PricingRule>(
158 "Incorrect type passed to function GlopParameters_InitialBasisHeuristic_Name.");
159 return ::PROTOBUF_NAMESPACE_ID::internal::NameOfEnum(
164 return ::PROTOBUF_NAMESPACE_ID::internal::ParseNamedEnum<GlopParameters_InitialBasisHeuristic>(
183 "Incorrect type passed to function GlopParameters_CostScalingAlgorithm_Name.");
184 return ::PROTOBUF_NAMESPACE_ID::internal::NameOfEnum(
189 return ::PROTOBUF_NAMESPACE_ID::internal::ParseNamedEnum<GlopParameters_CostScalingAlgorithm>(
195 public ::PROTOBUF_NAMESPACE_ID::Message {
199 explicit constexpr GlopParameters(::PROTOBUF_NAMESPACE_ID::internal::ConstantInitialized);
204 *
this = ::std::move(from);
212 if (
this == &from)
return *
this;
213 if (GetOwningArena() == from.GetOwningArena()
214 #ifdef PROTOBUF_FORCE_COPY_IN_MOVE
215 && GetOwningArena() !=
nullptr
226 return _internal_metadata_.unknown_fields<::PROTOBUF_NAMESPACE_ID::UnknownFieldSet>(::PROTOBUF_NAMESPACE_ID::UnknownFieldSet::default_instance);
229 return _internal_metadata_.mutable_unknown_fields<::PROTOBUF_NAMESPACE_ID::UnknownFieldSet>();
232 static const ::PROTOBUF_NAMESPACE_ID::Descriptor*
descriptor() {
255 if (other ==
this)
return;
256 if (GetOwningArena() == other->GetOwningArena()) {
259 ::PROTOBUF_NAMESPACE_ID::internal::GenericSwap(
this, other);
263 if (other ==
this)
return;
264 GOOGLE_DCHECK(GetOwningArena() == other->GetOwningArena());
275 return CreateMaybeMessage<GlopParameters>(arena);
277 using ::PROTOBUF_NAMESPACE_ID::Message::CopyFrom;
279 using ::PROTOBUF_NAMESPACE_ID::Message::MergeFrom;
282 static void MergeImpl(::PROTOBUF_NAMESPACE_ID::Message* to, const ::PROTOBUF_NAMESPACE_ID::Message& from);
284 PROTOBUF_ATTRIBUTE_REINITIALIZES
void Clear() final;
290 ::PROTOBUF_NAMESPACE_ID::uint8* target, ::PROTOBUF_NAMESPACE_ID::io::EpsCopyOutputStream* stream) const final;
296 void SetCachedSize(
int size)
const final;
298 friend class ::PROTOBUF_NAMESPACE_ID::internal::AnyMetadata;
299 static ::PROTOBUF_NAMESPACE_ID::StringPiece FullMessageName() {
300 return "operations_research.glop.GlopParameters";
304 bool is_message_owned =
false);
306 static void ArenaDtor(
void*
object);
307 inline void RegisterArenaDtor(::PROTOBUF_NAMESPACE_ID::Arena* arena);
311 const ::PROTOBUF_NAMESPACE_ID::Message::ClassData*
GetClassData() const final;
313 ::PROTOBUF_NAMESPACE_ID::Metadata
GetMetadata() const final;
333 static inline const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor*
341 "Incorrect type passed to function ScalingAlgorithm_Name.");
365 static inline const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor*
373 "Incorrect type passed to function SolverBehavior_Name.");
397 static inline const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor*
405 "Incorrect type passed to function PricingRule_Name.");
431 static inline const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor*
439 "Incorrect type passed to function InitialBasisHeuristic_Name.");
465 static inline const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor*
473 "Incorrect type passed to function CostScalingAlgorithm_Name.");
541 bool _internal_has_use_dual_simplex()
const;
547 bool _internal_use_dual_simplex()
const;
548 void _internal_set_use_dual_simplex(
bool value);
554 bool _internal_has_allow_simplex_algorithm_change()
const;
560 bool _internal_allow_simplex_algorithm_change()
const;
561 void _internal_set_allow_simplex_algorithm_change(
bool value);
567 bool _internal_has_perturb_costs_in_dual_simplex()
const;
573 bool _internal_perturb_costs_in_dual_simplex()
const;
574 void _internal_set_perturb_costs_in_dual_simplex(
bool value);
580 bool _internal_has_log_search_progress()
const;
586 bool _internal_log_search_progress()
const;
587 void _internal_set_log_search_progress(
bool value);
593 bool _internal_has_feasibility_rule()
const;
606 bool _internal_has_optimization_rule()
const;
619 bool _internal_has_refactorization_threshold()
const;
625 double _internal_refactorization_threshold()
const;
626 void _internal_set_refactorization_threshold(
double value);
632 bool _internal_has_recompute_reduced_costs_threshold()
const;
638 double _internal_recompute_reduced_costs_threshold()
const;
639 void _internal_set_recompute_reduced_costs_threshold(
double value);
645 bool _internal_has_recompute_edges_norm_threshold()
const;
651 double _internal_recompute_edges_norm_threshold()
const;
652 void _internal_set_recompute_edges_norm_threshold(
double value);
658 bool _internal_has_primal_feasibility_tolerance()
const;
664 double _internal_primal_feasibility_tolerance()
const;
665 void _internal_set_primal_feasibility_tolerance(
double value);
671 bool _internal_has_dual_feasibility_tolerance()
const;
677 double _internal_dual_feasibility_tolerance()
const;
678 void _internal_set_dual_feasibility_tolerance(
double value);
684 bool _internal_has_ratio_test_zero_threshold()
const;
690 double _internal_ratio_test_zero_threshold()
const;
691 void _internal_set_ratio_test_zero_threshold(
double value);
697 bool _internal_has_harris_tolerance_ratio()
const;
703 double _internal_harris_tolerance_ratio()
const;
704 void _internal_set_harris_tolerance_ratio(
double value);
710 bool _internal_has_small_pivot_threshold()
const;
716 double _internal_small_pivot_threshold()
const;
717 void _internal_set_small_pivot_threshold(
double value);
723 bool _internal_has_minimum_acceptable_pivot()
const;
729 double _internal_minimum_acceptable_pivot()
const;
730 void _internal_set_minimum_acceptable_pivot(
double value);
736 bool _internal_has_initial_basis()
const;
749 bool _internal_has_basis_refactorization_period()
const;
755 ::PROTOBUF_NAMESPACE_ID::int32 _internal_basis_refactorization_period()
const;
756 void _internal_set_basis_refactorization_period(::PROTOBUF_NAMESPACE_ID::int32
value);
762 bool _internal_has_dualizer_threshold()
const;
768 double _internal_dualizer_threshold()
const;
769 void _internal_set_dualizer_threshold(
double value);
775 bool _internal_has_solution_feasibility_tolerance()
const;
781 double _internal_solution_feasibility_tolerance()
const;
782 void _internal_set_solution_feasibility_tolerance(
double value);
788 bool _internal_has_solve_dual_problem()
const;
801 bool _internal_has_markowitz_zlatev_parameter()
const;
807 ::PROTOBUF_NAMESPACE_ID::int32 _internal_markowitz_zlatev_parameter()
const;
808 void _internal_set_markowitz_zlatev_parameter(::PROTOBUF_NAMESPACE_ID::int32
value);
814 bool _internal_has_lu_factorization_pivot_threshold()
const;
820 double _internal_lu_factorization_pivot_threshold()
const;
821 void _internal_set_lu_factorization_pivot_threshold(
double value);
827 bool _internal_has_max_time_in_seconds()
const;
833 double _internal_max_time_in_seconds()
const;
834 void _internal_set_max_time_in_seconds(
double value);
840 bool _internal_has_max_number_of_iterations()
const;
846 ::PROTOBUF_NAMESPACE_ID::int64 _internal_max_number_of_iterations()
const;
847 void _internal_set_max_number_of_iterations(::PROTOBUF_NAMESPACE_ID::int64
value);
853 bool _internal_has_markowitz_singularity_threshold()
const;
859 double _internal_markowitz_singularity_threshold()
const;
860 void _internal_set_markowitz_singularity_threshold(
double value);
866 bool _internal_has_use_scaling()
const;
872 bool _internal_use_scaling()
const;
873 void _internal_set_use_scaling(
bool value);
879 bool _internal_has_use_transposed_matrix()
const;
885 bool _internal_use_transposed_matrix()
const;
886 void _internal_set_use_transposed_matrix(
bool value);
892 bool _internal_has_dynamically_adjust_refactorization_period()
const;
898 bool _internal_dynamically_adjust_refactorization_period()
const;
899 void _internal_set_dynamically_adjust_refactorization_period(
bool value);
905 bool _internal_has_provide_strong_optimal_guarantee()
const;
911 bool _internal_provide_strong_optimal_guarantee()
const;
912 void _internal_set_provide_strong_optimal_guarantee(
bool value);
918 bool _internal_has_devex_weights_reset_period()
const;
924 ::PROTOBUF_NAMESPACE_ID::int32 _internal_devex_weights_reset_period()
const;
925 void _internal_set_devex_weights_reset_period(::PROTOBUF_NAMESPACE_ID::int32
value);
931 bool _internal_has_dual_small_pivot_threshold()
const;
937 double _internal_dual_small_pivot_threshold()
const;
938 void _internal_set_dual_small_pivot_threshold(
double value);
944 bool _internal_has_preprocessor_zero_tolerance()
const;
950 double _internal_preprocessor_zero_tolerance()
const;
951 void _internal_set_preprocessor_zero_tolerance(
double value);
957 bool _internal_has_objective_lower_limit()
const;
963 double _internal_objective_lower_limit()
const;
964 void _internal_set_objective_lower_limit(
double value);
970 bool _internal_has_objective_upper_limit()
const;
976 double _internal_objective_upper_limit()
const;
977 void _internal_set_objective_upper_limit(
double value);
983 bool _internal_has_change_status_to_imprecise()
const;
989 bool _internal_change_status_to_imprecise()
const;
990 void _internal_set_change_status_to_imprecise(
bool value);
996 bool _internal_has_use_preprocessing()
const;
1002 bool _internal_use_preprocessing()
const;
1003 void _internal_set_use_preprocessing(
bool value);
1009 bool _internal_has_use_middle_product_form_update()
const;
1015 bool _internal_use_middle_product_form_update()
const;
1016 void _internal_set_use_middle_product_form_update(
bool value);
1022 bool _internal_has_initialize_devex_with_column_norms()
const;
1028 bool _internal_initialize_devex_with_column_norms()
const;
1029 void _internal_set_initialize_devex_with_column_norms(
bool value);
1035 bool _internal_has_random_seed()
const;
1038 ::PROTOBUF_NAMESPACE_ID::int32
random_seed()
const;
1041 ::PROTOBUF_NAMESPACE_ID::int32 _internal_random_seed()
const;
1042 void _internal_set_random_seed(::PROTOBUF_NAMESPACE_ID::int32
value);
1048 bool _internal_has_degenerate_ministep_factor()
const;
1054 double _internal_degenerate_ministep_factor()
const;
1055 void _internal_set_degenerate_ministep_factor(
double value);
1061 bool _internal_has_max_deterministic_time()
const;
1067 double _internal_max_deterministic_time()
const;
1068 void _internal_set_max_deterministic_time(
double value);
1074 bool _internal_has_drop_tolerance()
const;
1080 double _internal_drop_tolerance()
const;
1081 void _internal_set_drop_tolerance(
double value);
1087 bool _internal_has_num_omp_threads()
const;
1093 ::PROTOBUF_NAMESPACE_ID::int32 _internal_num_omp_threads()
const;
1094 void _internal_set_num_omp_threads(::PROTOBUF_NAMESPACE_ID::int32
value);
1100 bool _internal_has_exploit_singleton_column_in_initial_basis()
const;
1106 bool _internal_exploit_singleton_column_in_initial_basis()
const;
1107 void _internal_set_exploit_singleton_column_in_initial_basis(
bool value);
1113 bool _internal_has_use_dedicated_dual_feasibility_algorithm()
const;
1119 bool _internal_use_dedicated_dual_feasibility_algorithm()
const;
1120 void _internal_set_use_dedicated_dual_feasibility_algorithm(
bool value);
1126 bool _internal_has_push_to_vertex()
const;
1132 bool _internal_push_to_vertex()
const;
1133 void _internal_set_push_to_vertex(
bool value);
1139 bool _internal_has_relative_cost_perturbation()
const;
1145 double _internal_relative_cost_perturbation()
const;
1146 void _internal_set_relative_cost_perturbation(
double value);
1152 bool _internal_has_relative_max_cost_perturbation()
const;
1158 double _internal_relative_max_cost_perturbation()
const;
1159 void _internal_set_relative_max_cost_perturbation(
double value);
1165 bool _internal_has_max_number_of_reoptimizations()
const;
1171 double _internal_max_number_of_reoptimizations()
const;
1172 void _internal_set_max_number_of_reoptimizations(
double value);
1178 bool _internal_has_scaling_method()
const;
1191 bool _internal_has_cost_scaling()
const;
1204 bool _internal_has_initial_condition_number_threshold()
const;
1210 double _internal_initial_condition_number_threshold()
const;
1211 void _internal_set_initial_condition_number_threshold(
double value);
1217 bool _internal_has_crossover_bound_snapping_distance()
const;
1223 double _internal_crossover_bound_snapping_distance()
const;
1224 void _internal_set_crossover_bound_snapping_distance(
double value);
1231 template <
typename T>
friend class ::PROTOBUF_NAMESPACE_ID::Arena::InternalHelper;
1232 typedef void InternalArenaConstructable_;
1233 typedef void DestructorSkippable_;
1234 ::PROTOBUF_NAMESPACE_ID::internal::HasBits<2> _has_bits_;
1235 mutable ::PROTOBUF_NAMESPACE_ID::internal::CachedSize _cached_size_;
1236 bool use_dual_simplex_;
1237 bool allow_simplex_algorithm_change_;
1238 bool perturb_costs_in_dual_simplex_;
1239 bool log_search_progress_;
1240 int feasibility_rule_;
1241 int optimization_rule_;
1242 double refactorization_threshold_;
1243 double recompute_reduced_costs_threshold_;
1244 double recompute_edges_norm_threshold_;
1245 double primal_feasibility_tolerance_;
1246 double dual_feasibility_tolerance_;
1247 double ratio_test_zero_threshold_;
1248 double harris_tolerance_ratio_;
1249 double small_pivot_threshold_;
1250 double minimum_acceptable_pivot_;
1252 ::PROTOBUF_NAMESPACE_ID::int32 basis_refactorization_period_;
1253 double dualizer_threshold_;
1254 double solution_feasibility_tolerance_;
1255 int solve_dual_problem_;
1256 ::PROTOBUF_NAMESPACE_ID::int32 markowitz_zlatev_parameter_;
1257 double lu_factorization_pivot_threshold_;
1258 double max_time_in_seconds_;
1259 ::PROTOBUF_NAMESPACE_ID::int64 max_number_of_iterations_;
1260 double markowitz_singularity_threshold_;
1262 bool use_transposed_matrix_;
1263 bool dynamically_adjust_refactorization_period_;
1264 bool provide_strong_optimal_guarantee_;
1265 ::PROTOBUF_NAMESPACE_ID::int32 devex_weights_reset_period_;
1266 double dual_small_pivot_threshold_;
1267 double preprocessor_zero_tolerance_;
1268 double objective_lower_limit_;
1269 double objective_upper_limit_;
1270 bool change_status_to_imprecise_;
1271 bool use_preprocessing_;
1272 bool use_middle_product_form_update_;
1273 bool initialize_devex_with_column_norms_;
1274 ::PROTOBUF_NAMESPACE_ID::int32 random_seed_;
1275 double degenerate_ministep_factor_;
1276 double max_deterministic_time_;
1277 double drop_tolerance_;
1278 ::PROTOBUF_NAMESPACE_ID::int32 num_omp_threads_;
1279 bool exploit_singleton_column_in_initial_basis_;
1280 bool use_dedicated_dual_feasibility_algorithm_;
1281 bool push_to_vertex_;
1282 double relative_cost_perturbation_;
1283 double relative_max_cost_perturbation_;
1284 double max_number_of_reoptimizations_;
1285 int scaling_method_;
1287 double initial_condition_number_threshold_;
1288 double crossover_bound_snapping_distance_;
1289 friend struct ::TableStruct_ortools_2fglop_2fparameters_2eproto;
1297 #pragma GCC diagnostic push
1298 #pragma GCC diagnostic ignored "-Wstrict-aliasing"
1303inline bool GlopParameters::_internal_has_scaling_method()
const {
1304 bool value = (_has_bits_[1] & 0x00020000u) != 0;
1308 return _internal_has_scaling_method();
1311 scaling_method_ = 1;
1312 _has_bits_[1] &= ~0x00020000u;
1319 return _internal_scaling_method();
1323 _has_bits_[1] |= 0x00020000u;
1324 scaling_method_ =
value;
1327 _internal_set_scaling_method(
value);
1332inline bool GlopParameters::_internal_has_feasibility_rule()
const {
1333 bool value = (_has_bits_[0] & 0x00000010u) != 0;
1337 return _internal_has_feasibility_rule();
1340 feasibility_rule_ = 1;
1341 _has_bits_[0] &= ~0x00000010u;
1348 return _internal_feasibility_rule();
1352 _has_bits_[0] |= 0x00000010u;
1353 feasibility_rule_ =
value;
1356 _internal_set_feasibility_rule(
value);
1361inline bool GlopParameters::_internal_has_optimization_rule()
const {
1362 bool value = (_has_bits_[0] & 0x00000020u) != 0;
1366 return _internal_has_optimization_rule();
1369 optimization_rule_ = 1;
1370 _has_bits_[0] &= ~0x00000020u;
1377 return _internal_optimization_rule();
1381 _has_bits_[0] |= 0x00000020u;
1382 optimization_rule_ =
value;
1385 _internal_set_optimization_rule(
value);
1390inline bool GlopParameters::_internal_has_refactorization_threshold()
const {
1391 bool value = (_has_bits_[0] & 0x00000040u) != 0;
1395 return _internal_has_refactorization_threshold();
1398 refactorization_threshold_ = 1e-09;
1399 _has_bits_[0] &= ~0x00000040u;
1401inline double GlopParameters::_internal_refactorization_threshold()
const {
1402 return refactorization_threshold_;
1406 return _internal_refactorization_threshold();
1408inline void GlopParameters::_internal_set_refactorization_threshold(
double value) {
1409 _has_bits_[0] |= 0x00000040u;
1410 refactorization_threshold_ =
value;
1413 _internal_set_refactorization_threshold(
value);
1418inline bool GlopParameters::_internal_has_recompute_reduced_costs_threshold()
const {
1419 bool value = (_has_bits_[0] & 0x00000080u) != 0;
1423 return _internal_has_recompute_reduced_costs_threshold();
1426 recompute_reduced_costs_threshold_ = 1e-08;
1427 _has_bits_[0] &= ~0x00000080u;
1429inline double GlopParameters::_internal_recompute_reduced_costs_threshold()
const {
1430 return recompute_reduced_costs_threshold_;
1434 return _internal_recompute_reduced_costs_threshold();
1436inline void GlopParameters::_internal_set_recompute_reduced_costs_threshold(
double value) {
1437 _has_bits_[0] |= 0x00000080u;
1438 recompute_reduced_costs_threshold_ =
value;
1441 _internal_set_recompute_reduced_costs_threshold(
value);
1446inline bool GlopParameters::_internal_has_recompute_edges_norm_threshold()
const {
1447 bool value = (_has_bits_[0] & 0x00000100u) != 0;
1451 return _internal_has_recompute_edges_norm_threshold();
1454 recompute_edges_norm_threshold_ = 100;
1455 _has_bits_[0] &= ~0x00000100u;
1457inline double GlopParameters::_internal_recompute_edges_norm_threshold()
const {
1458 return recompute_edges_norm_threshold_;
1462 return _internal_recompute_edges_norm_threshold();
1464inline void GlopParameters::_internal_set_recompute_edges_norm_threshold(
double value) {
1465 _has_bits_[0] |= 0x00000100u;
1466 recompute_edges_norm_threshold_ =
value;
1469 _internal_set_recompute_edges_norm_threshold(
value);
1474inline bool GlopParameters::_internal_has_primal_feasibility_tolerance()
const {
1475 bool value = (_has_bits_[0] & 0x00000200u) != 0;
1479 return _internal_has_primal_feasibility_tolerance();
1482 primal_feasibility_tolerance_ = 1e-08;
1483 _has_bits_[0] &= ~0x00000200u;
1485inline double GlopParameters::_internal_primal_feasibility_tolerance()
const {
1486 return primal_feasibility_tolerance_;
1490 return _internal_primal_feasibility_tolerance();
1492inline void GlopParameters::_internal_set_primal_feasibility_tolerance(
double value) {
1493 _has_bits_[0] |= 0x00000200u;
1494 primal_feasibility_tolerance_ =
value;
1497 _internal_set_primal_feasibility_tolerance(
value);
1502inline bool GlopParameters::_internal_has_dual_feasibility_tolerance()
const {
1503 bool value = (_has_bits_[0] & 0x00000400u) != 0;
1507 return _internal_has_dual_feasibility_tolerance();
1510 dual_feasibility_tolerance_ = 1e-08;
1511 _has_bits_[0] &= ~0x00000400u;
1513inline double GlopParameters::_internal_dual_feasibility_tolerance()
const {
1514 return dual_feasibility_tolerance_;
1518 return _internal_dual_feasibility_tolerance();
1520inline void GlopParameters::_internal_set_dual_feasibility_tolerance(
double value) {
1521 _has_bits_[0] |= 0x00000400u;
1522 dual_feasibility_tolerance_ =
value;
1525 _internal_set_dual_feasibility_tolerance(
value);
1530inline bool GlopParameters::_internal_has_ratio_test_zero_threshold()
const {
1531 bool value = (_has_bits_[0] & 0x00000800u) != 0;
1535 return _internal_has_ratio_test_zero_threshold();
1538 ratio_test_zero_threshold_ = 1e-09;
1539 _has_bits_[0] &= ~0x00000800u;
1541inline double GlopParameters::_internal_ratio_test_zero_threshold()
const {
1542 return ratio_test_zero_threshold_;
1546 return _internal_ratio_test_zero_threshold();
1548inline void GlopParameters::_internal_set_ratio_test_zero_threshold(
double value) {
1549 _has_bits_[0] |= 0x00000800u;
1550 ratio_test_zero_threshold_ =
value;
1553 _internal_set_ratio_test_zero_threshold(
value);
1558inline bool GlopParameters::_internal_has_harris_tolerance_ratio()
const {
1559 bool value = (_has_bits_[0] & 0x00001000u) != 0;
1563 return _internal_has_harris_tolerance_ratio();
1566 harris_tolerance_ratio_ = 0.5;
1567 _has_bits_[0] &= ~0x00001000u;
1569inline double GlopParameters::_internal_harris_tolerance_ratio()
const {
1570 return harris_tolerance_ratio_;
1574 return _internal_harris_tolerance_ratio();
1576inline void GlopParameters::_internal_set_harris_tolerance_ratio(
double value) {
1577 _has_bits_[0] |= 0x00001000u;
1578 harris_tolerance_ratio_ =
value;
1581 _internal_set_harris_tolerance_ratio(
value);
1586inline bool GlopParameters::_internal_has_small_pivot_threshold()
const {
1587 bool value = (_has_bits_[0] & 0x00002000u) != 0;
1591 return _internal_has_small_pivot_threshold();
1594 small_pivot_threshold_ = 1e-06;
1595 _has_bits_[0] &= ~0x00002000u;
1597inline double GlopParameters::_internal_small_pivot_threshold()
const {
1598 return small_pivot_threshold_;
1602 return _internal_small_pivot_threshold();
1604inline void GlopParameters::_internal_set_small_pivot_threshold(
double value) {
1605 _has_bits_[0] |= 0x00002000u;
1606 small_pivot_threshold_ =
value;
1609 _internal_set_small_pivot_threshold(
value);
1614inline bool GlopParameters::_internal_has_minimum_acceptable_pivot()
const {
1615 bool value = (_has_bits_[0] & 0x00004000u) != 0;
1619 return _internal_has_minimum_acceptable_pivot();
1622 minimum_acceptable_pivot_ = 1e-06;
1623 _has_bits_[0] &= ~0x00004000u;
1625inline double GlopParameters::_internal_minimum_acceptable_pivot()
const {
1626 return minimum_acceptable_pivot_;
1630 return _internal_minimum_acceptable_pivot();
1632inline void GlopParameters::_internal_set_minimum_acceptable_pivot(
double value) {
1633 _has_bits_[0] |= 0x00004000u;
1634 minimum_acceptable_pivot_ =
value;
1637 _internal_set_minimum_acceptable_pivot(
value);
1642inline bool GlopParameters::_internal_has_drop_tolerance()
const {
1643 bool value = (_has_bits_[1] & 0x00000200u) != 0;
1647 return _internal_has_drop_tolerance();
1650 drop_tolerance_ = 1e-14;
1651 _has_bits_[1] &= ~0x00000200u;
1653inline double GlopParameters::_internal_drop_tolerance()
const {
1654 return drop_tolerance_;
1658 return _internal_drop_tolerance();
1660inline void GlopParameters::_internal_set_drop_tolerance(
double value) {
1661 _has_bits_[1] |= 0x00000200u;
1662 drop_tolerance_ =
value;
1665 _internal_set_drop_tolerance(
value);
1670inline bool GlopParameters::_internal_has_use_scaling()
const {
1671 bool value = (_has_bits_[0] & 0x02000000u) != 0;
1675 return _internal_has_use_scaling();
1678 use_scaling_ =
true;
1679 _has_bits_[0] &= ~0x02000000u;
1681inline bool GlopParameters::_internal_use_scaling()
const {
1682 return use_scaling_;
1686 return _internal_use_scaling();
1688inline void GlopParameters::_internal_set_use_scaling(
bool value) {
1689 _has_bits_[0] |= 0x02000000u;
1690 use_scaling_ =
value;
1693 _internal_set_use_scaling(
value);
1698inline bool GlopParameters::_internal_has_cost_scaling()
const {
1699 bool value = (_has_bits_[1] & 0x00040000u) != 0;
1703 return _internal_has_cost_scaling();
1707 _has_bits_[1] &= ~0x00040000u;
1714 return _internal_cost_scaling();
1718 _has_bits_[1] |= 0x00040000u;
1719 cost_scaling_ =
value;
1722 _internal_set_cost_scaling(
value);
1727inline bool GlopParameters::_internal_has_initial_basis()
const {
1728 bool value = (_has_bits_[0] & 0x00008000u) != 0;
1732 return _internal_has_initial_basis();
1736 _has_bits_[0] &= ~0x00008000u;
1743 return _internal_initial_basis();
1747 _has_bits_[0] |= 0x00008000u;
1748 initial_basis_ =
value;
1751 _internal_set_initial_basis(
value);
1756inline bool GlopParameters::_internal_has_use_transposed_matrix()
const {
1757 bool value = (_has_bits_[0] & 0x04000000u) != 0;
1761 return _internal_has_use_transposed_matrix();
1764 use_transposed_matrix_ =
true;
1765 _has_bits_[0] &= ~0x04000000u;
1767inline bool GlopParameters::_internal_use_transposed_matrix()
const {
1768 return use_transposed_matrix_;
1772 return _internal_use_transposed_matrix();
1774inline void GlopParameters::_internal_set_use_transposed_matrix(
bool value) {
1775 _has_bits_[0] |= 0x04000000u;
1776 use_transposed_matrix_ =
value;
1779 _internal_set_use_transposed_matrix(
value);
1784inline bool GlopParameters::_internal_has_basis_refactorization_period()
const {
1785 bool value = (_has_bits_[0] & 0x00010000u) != 0;
1789 return _internal_has_basis_refactorization_period();
1792 basis_refactorization_period_ = 64;
1793 _has_bits_[0] &= ~0x00010000u;
1795inline ::PROTOBUF_NAMESPACE_ID::int32 GlopParameters::_internal_basis_refactorization_period()
const {
1796 return basis_refactorization_period_;
1800 return _internal_basis_refactorization_period();
1802inline void GlopParameters::_internal_set_basis_refactorization_period(::PROTOBUF_NAMESPACE_ID::int32
value) {
1803 _has_bits_[0] |= 0x00010000u;
1804 basis_refactorization_period_ =
value;
1807 _internal_set_basis_refactorization_period(
value);
1812inline bool GlopParameters::_internal_has_dynamically_adjust_refactorization_period()
const {
1813 bool value = (_has_bits_[0] & 0x08000000u) != 0;
1817 return _internal_has_dynamically_adjust_refactorization_period();
1820 dynamically_adjust_refactorization_period_ =
true;
1821 _has_bits_[0] &= ~0x08000000u;
1823inline bool GlopParameters::_internal_dynamically_adjust_refactorization_period()
const {
1824 return dynamically_adjust_refactorization_period_;
1828 return _internal_dynamically_adjust_refactorization_period();
1830inline void GlopParameters::_internal_set_dynamically_adjust_refactorization_period(
bool value) {
1831 _has_bits_[0] |= 0x08000000u;
1832 dynamically_adjust_refactorization_period_ =
value;
1835 _internal_set_dynamically_adjust_refactorization_period(
value);
1840inline bool GlopParameters::_internal_has_solve_dual_problem()
const {
1841 bool value = (_has_bits_[0] & 0x00080000u) != 0;
1845 return _internal_has_solve_dual_problem();
1848 solve_dual_problem_ = 2;
1849 _has_bits_[0] &= ~0x00080000u;
1856 return _internal_solve_dual_problem();
1860 _has_bits_[0] |= 0x00080000u;
1861 solve_dual_problem_ =
value;
1864 _internal_set_solve_dual_problem(
value);
1869inline bool GlopParameters::_internal_has_dualizer_threshold()
const {
1870 bool value = (_has_bits_[0] & 0x00020000u) != 0;
1874 return _internal_has_dualizer_threshold();
1877 dualizer_threshold_ = 1.5;
1878 _has_bits_[0] &= ~0x00020000u;
1880inline double GlopParameters::_internal_dualizer_threshold()
const {
1881 return dualizer_threshold_;
1885 return _internal_dualizer_threshold();
1887inline void GlopParameters::_internal_set_dualizer_threshold(
double value) {
1888 _has_bits_[0] |= 0x00020000u;
1889 dualizer_threshold_ =
value;
1892 _internal_set_dualizer_threshold(
value);
1897inline bool GlopParameters::_internal_has_solution_feasibility_tolerance()
const {
1898 bool value = (_has_bits_[0] & 0x00040000u) != 0;
1902 return _internal_has_solution_feasibility_tolerance();
1905 solution_feasibility_tolerance_ = 1e-06;
1906 _has_bits_[0] &= ~0x00040000u;
1908inline double GlopParameters::_internal_solution_feasibility_tolerance()
const {
1909 return solution_feasibility_tolerance_;
1913 return _internal_solution_feasibility_tolerance();
1915inline void GlopParameters::_internal_set_solution_feasibility_tolerance(
double value) {
1916 _has_bits_[0] |= 0x00040000u;
1917 solution_feasibility_tolerance_ =
value;
1920 _internal_set_solution_feasibility_tolerance(
value);
1925inline bool GlopParameters::_internal_has_provide_strong_optimal_guarantee()
const {
1926 bool value = (_has_bits_[0] & 0x10000000u) != 0;
1930 return _internal_has_provide_strong_optimal_guarantee();
1933 provide_strong_optimal_guarantee_ =
true;
1934 _has_bits_[0] &= ~0x10000000u;
1936inline bool GlopParameters::_internal_provide_strong_optimal_guarantee()
const {
1937 return provide_strong_optimal_guarantee_;
1941 return _internal_provide_strong_optimal_guarantee();
1943inline void GlopParameters::_internal_set_provide_strong_optimal_guarantee(
bool value) {
1944 _has_bits_[0] |= 0x10000000u;
1945 provide_strong_optimal_guarantee_ =
value;
1948 _internal_set_provide_strong_optimal_guarantee(
value);
1953inline bool GlopParameters::_internal_has_change_status_to_imprecise()
const {
1954 bool value = (_has_bits_[1] & 0x00000004u) != 0;
1958 return _internal_has_change_status_to_imprecise();
1961 change_status_to_imprecise_ =
true;
1962 _has_bits_[1] &= ~0x00000004u;
1964inline bool GlopParameters::_internal_change_status_to_imprecise()
const {
1965 return change_status_to_imprecise_;
1969 return _internal_change_status_to_imprecise();
1971inline void GlopParameters::_internal_set_change_status_to_imprecise(
bool value) {
1972 _has_bits_[1] |= 0x00000004u;
1973 change_status_to_imprecise_ =
value;
1976 _internal_set_change_status_to_imprecise(
value);
1981inline bool GlopParameters::_internal_has_max_number_of_reoptimizations()
const {
1982 bool value = (_has_bits_[1] & 0x00010000u) != 0;
1986 return _internal_has_max_number_of_reoptimizations();
1989 max_number_of_reoptimizations_ = 40;
1990 _has_bits_[1] &= ~0x00010000u;
1992inline double GlopParameters::_internal_max_number_of_reoptimizations()
const {
1993 return max_number_of_reoptimizations_;
1997 return _internal_max_number_of_reoptimizations();
1999inline void GlopParameters::_internal_set_max_number_of_reoptimizations(
double value) {
2000 _has_bits_[1] |= 0x00010000u;
2001 max_number_of_reoptimizations_ =
value;
2004 _internal_set_max_number_of_reoptimizations(
value);
2009inline bool GlopParameters::_internal_has_lu_factorization_pivot_threshold()
const {
2010 bool value = (_has_bits_[0] & 0x00200000u) != 0;
2014 return _internal_has_lu_factorization_pivot_threshold();
2017 lu_factorization_pivot_threshold_ = 0.01;
2018 _has_bits_[0] &= ~0x00200000u;
2020inline double GlopParameters::_internal_lu_factorization_pivot_threshold()
const {
2021 return lu_factorization_pivot_threshold_;
2025 return _internal_lu_factorization_pivot_threshold();
2027inline void GlopParameters::_internal_set_lu_factorization_pivot_threshold(
double value) {
2028 _has_bits_[0] |= 0x00200000u;
2029 lu_factorization_pivot_threshold_ =
value;
2032 _internal_set_lu_factorization_pivot_threshold(
value);
2037inline bool GlopParameters::_internal_has_max_time_in_seconds()
const {
2038 bool value = (_has_bits_[0] & 0x00400000u) != 0;
2042 return _internal_has_max_time_in_seconds();
2045 max_time_in_seconds_ = std::numeric_limits<double>::infinity();
2046 _has_bits_[0] &= ~0x00400000u;
2048inline double GlopParameters::_internal_max_time_in_seconds()
const {
2049 return max_time_in_seconds_;
2053 return _internal_max_time_in_seconds();
2055inline void GlopParameters::_internal_set_max_time_in_seconds(
double value) {
2056 _has_bits_[0] |= 0x00400000u;
2057 max_time_in_seconds_ =
value;
2060 _internal_set_max_time_in_seconds(
value);
2065inline bool GlopParameters::_internal_has_max_deterministic_time()
const {
2066 bool value = (_has_bits_[1] & 0x00000100u) != 0;
2070 return _internal_has_max_deterministic_time();
2073 max_deterministic_time_ = std::numeric_limits<double>::infinity();
2074 _has_bits_[1] &= ~0x00000100u;
2076inline double GlopParameters::_internal_max_deterministic_time()
const {
2077 return max_deterministic_time_;
2081 return _internal_max_deterministic_time();
2083inline void GlopParameters::_internal_set_max_deterministic_time(
double value) {
2084 _has_bits_[1] |= 0x00000100u;
2085 max_deterministic_time_ =
value;
2088 _internal_set_max_deterministic_time(
value);
2093inline bool GlopParameters::_internal_has_max_number_of_iterations()
const {
2094 bool value = (_has_bits_[0] & 0x00800000u) != 0;
2098 return _internal_has_max_number_of_iterations();
2101 max_number_of_iterations_ = int64_t{-1};
2102 _has_bits_[0] &= ~0x00800000u;
2104inline ::PROTOBUF_NAMESPACE_ID::int64 GlopParameters::_internal_max_number_of_iterations()
const {
2105 return max_number_of_iterations_;
2109 return _internal_max_number_of_iterations();
2111inline void GlopParameters::_internal_set_max_number_of_iterations(::PROTOBUF_NAMESPACE_ID::int64
value) {
2112 _has_bits_[0] |= 0x00800000u;
2113 max_number_of_iterations_ =
value;
2116 _internal_set_max_number_of_iterations(
value);
2121inline bool GlopParameters::_internal_has_markowitz_zlatev_parameter()
const {
2122 bool value = (_has_bits_[0] & 0x00100000u) != 0;
2126 return _internal_has_markowitz_zlatev_parameter();
2129 markowitz_zlatev_parameter_ = 3;
2130 _has_bits_[0] &= ~0x00100000u;
2132inline ::PROTOBUF_NAMESPACE_ID::int32 GlopParameters::_internal_markowitz_zlatev_parameter()
const {
2133 return markowitz_zlatev_parameter_;
2137 return _internal_markowitz_zlatev_parameter();
2139inline void GlopParameters::_internal_set_markowitz_zlatev_parameter(::PROTOBUF_NAMESPACE_ID::int32
value) {
2140 _has_bits_[0] |= 0x00100000u;
2141 markowitz_zlatev_parameter_ =
value;
2144 _internal_set_markowitz_zlatev_parameter(
value);
2149inline bool GlopParameters::_internal_has_markowitz_singularity_threshold()
const {
2150 bool value = (_has_bits_[0] & 0x01000000u) != 0;
2154 return _internal_has_markowitz_singularity_threshold();
2157 markowitz_singularity_threshold_ = 1e-15;
2158 _has_bits_[0] &= ~0x01000000u;
2160inline double GlopParameters::_internal_markowitz_singularity_threshold()
const {
2161 return markowitz_singularity_threshold_;
2165 return _internal_markowitz_singularity_threshold();
2167inline void GlopParameters::_internal_set_markowitz_singularity_threshold(
double value) {
2168 _has_bits_[0] |= 0x01000000u;
2169 markowitz_singularity_threshold_ =
value;
2172 _internal_set_markowitz_singularity_threshold(
value);
2177inline bool GlopParameters::_internal_has_use_dual_simplex()
const {
2178 bool value = (_has_bits_[0] & 0x00000001u) != 0;
2182 return _internal_has_use_dual_simplex();
2185 use_dual_simplex_ =
false;
2186 _has_bits_[0] &= ~0x00000001u;
2188inline bool GlopParameters::_internal_use_dual_simplex()
const {
2189 return use_dual_simplex_;
2193 return _internal_use_dual_simplex();
2195inline void GlopParameters::_internal_set_use_dual_simplex(
bool value) {
2196 _has_bits_[0] |= 0x00000001u;
2197 use_dual_simplex_ =
value;
2200 _internal_set_use_dual_simplex(
value);
2205inline bool GlopParameters::_internal_has_allow_simplex_algorithm_change()
const {
2206 bool value = (_has_bits_[0] & 0x00000002u) != 0;
2210 return _internal_has_allow_simplex_algorithm_change();
2213 allow_simplex_algorithm_change_ =
false;
2214 _has_bits_[0] &= ~0x00000002u;
2216inline bool GlopParameters::_internal_allow_simplex_algorithm_change()
const {
2217 return allow_simplex_algorithm_change_;
2221 return _internal_allow_simplex_algorithm_change();
2223inline void GlopParameters::_internal_set_allow_simplex_algorithm_change(
bool value) {
2224 _has_bits_[0] |= 0x00000002u;
2225 allow_simplex_algorithm_change_ =
value;
2228 _internal_set_allow_simplex_algorithm_change(
value);
2233inline bool GlopParameters::_internal_has_devex_weights_reset_period()
const {
2234 bool value = (_has_bits_[0] & 0x20000000u) != 0;
2238 return _internal_has_devex_weights_reset_period();
2241 devex_weights_reset_period_ = 150;
2242 _has_bits_[0] &= ~0x20000000u;
2244inline ::PROTOBUF_NAMESPACE_ID::int32 GlopParameters::_internal_devex_weights_reset_period()
const {
2245 return devex_weights_reset_period_;
2249 return _internal_devex_weights_reset_period();
2251inline void GlopParameters::_internal_set_devex_weights_reset_period(::PROTOBUF_NAMESPACE_ID::int32
value) {
2252 _has_bits_[0] |= 0x20000000u;
2253 devex_weights_reset_period_ =
value;
2256 _internal_set_devex_weights_reset_period(
value);
2261inline bool GlopParameters::_internal_has_use_preprocessing()
const {
2262 bool value = (_has_bits_[1] & 0x00000008u) != 0;
2266 return _internal_has_use_preprocessing();
2269 use_preprocessing_ =
true;
2270 _has_bits_[1] &= ~0x00000008u;
2272inline bool GlopParameters::_internal_use_preprocessing()
const {
2273 return use_preprocessing_;
2277 return _internal_use_preprocessing();
2279inline void GlopParameters::_internal_set_use_preprocessing(
bool value) {
2280 _has_bits_[1] |= 0x00000008u;
2281 use_preprocessing_ =
value;
2284 _internal_set_use_preprocessing(
value);
2289inline bool GlopParameters::_internal_has_use_middle_product_form_update()
const {
2290 bool value = (_has_bits_[1] & 0x00000010u) != 0;
2294 return _internal_has_use_middle_product_form_update();
2297 use_middle_product_form_update_ =
true;
2298 _has_bits_[1] &= ~0x00000010u;
2300inline bool GlopParameters::_internal_use_middle_product_form_update()
const {
2301 return use_middle_product_form_update_;
2305 return _internal_use_middle_product_form_update();
2307inline void GlopParameters::_internal_set_use_middle_product_form_update(
bool value) {
2308 _has_bits_[1] |= 0x00000010u;
2309 use_middle_product_form_update_ =
value;
2312 _internal_set_use_middle_product_form_update(
value);
2317inline bool GlopParameters::_internal_has_initialize_devex_with_column_norms()
const {
2318 bool value = (_has_bits_[1] & 0x00000020u) != 0;
2322 return _internal_has_initialize_devex_with_column_norms();
2325 initialize_devex_with_column_norms_ =
true;
2326 _has_bits_[1] &= ~0x00000020u;
2328inline bool GlopParameters::_internal_initialize_devex_with_column_norms()
const {
2329 return initialize_devex_with_column_norms_;
2333 return _internal_initialize_devex_with_column_norms();
2335inline void GlopParameters::_internal_set_initialize_devex_with_column_norms(
bool value) {
2336 _has_bits_[1] |= 0x00000020u;
2337 initialize_devex_with_column_norms_ =
value;
2340 _internal_set_initialize_devex_with_column_norms(
value);
2345inline bool GlopParameters::_internal_has_exploit_singleton_column_in_initial_basis()
const {
2346 bool value = (_has_bits_[1] & 0x00000800u) != 0;
2350 return _internal_has_exploit_singleton_column_in_initial_basis();
2353 exploit_singleton_column_in_initial_basis_ =
true;
2354 _has_bits_[1] &= ~0x00000800u;
2356inline bool GlopParameters::_internal_exploit_singleton_column_in_initial_basis()
const {
2357 return exploit_singleton_column_in_initial_basis_;
2361 return _internal_exploit_singleton_column_in_initial_basis();
2363inline void GlopParameters::_internal_set_exploit_singleton_column_in_initial_basis(
bool value) {
2364 _has_bits_[1] |= 0x00000800u;
2365 exploit_singleton_column_in_initial_basis_ =
value;
2368 _internal_set_exploit_singleton_column_in_initial_basis(
value);
2373inline bool GlopParameters::_internal_has_dual_small_pivot_threshold()
const {
2374 bool value = (_has_bits_[0] & 0x40000000u) != 0;
2378 return _internal_has_dual_small_pivot_threshold();
2381 dual_small_pivot_threshold_ = 0.0001;
2382 _has_bits_[0] &= ~0x40000000u;
2384inline double GlopParameters::_internal_dual_small_pivot_threshold()
const {
2385 return dual_small_pivot_threshold_;
2389 return _internal_dual_small_pivot_threshold();
2391inline void GlopParameters::_internal_set_dual_small_pivot_threshold(
double value) {
2392 _has_bits_[0] |= 0x40000000u;
2393 dual_small_pivot_threshold_ =
value;
2396 _internal_set_dual_small_pivot_threshold(
value);
2401inline bool GlopParameters::_internal_has_preprocessor_zero_tolerance()
const {
2402 bool value = (_has_bits_[0] & 0x80000000u) != 0;
2406 return _internal_has_preprocessor_zero_tolerance();
2409 preprocessor_zero_tolerance_ = 1e-09;
2410 _has_bits_[0] &= ~0x80000000u;
2412inline double GlopParameters::_internal_preprocessor_zero_tolerance()
const {
2413 return preprocessor_zero_tolerance_;
2417 return _internal_preprocessor_zero_tolerance();
2419inline void GlopParameters::_internal_set_preprocessor_zero_tolerance(
double value) {
2420 _has_bits_[0] |= 0x80000000u;
2421 preprocessor_zero_tolerance_ =
value;
2424 _internal_set_preprocessor_zero_tolerance(
value);
2429inline bool GlopParameters::_internal_has_objective_lower_limit()
const {
2430 bool value = (_has_bits_[1] & 0x00000001u) != 0;
2434 return _internal_has_objective_lower_limit();
2437 objective_lower_limit_ = -std::numeric_limits<double>::infinity();
2438 _has_bits_[1] &= ~0x00000001u;
2440inline double GlopParameters::_internal_objective_lower_limit()
const {
2441 return objective_lower_limit_;
2445 return _internal_objective_lower_limit();
2447inline void GlopParameters::_internal_set_objective_lower_limit(
double value) {
2448 _has_bits_[1] |= 0x00000001u;
2449 objective_lower_limit_ =
value;
2452 _internal_set_objective_lower_limit(
value);
2457inline bool GlopParameters::_internal_has_objective_upper_limit()
const {
2458 bool value = (_has_bits_[1] & 0x00000002u) != 0;
2462 return _internal_has_objective_upper_limit();
2465 objective_upper_limit_ = std::numeric_limits<double>::infinity();
2466 _has_bits_[1] &= ~0x00000002u;
2468inline double GlopParameters::_internal_objective_upper_limit()
const {
2469 return objective_upper_limit_;
2473 return _internal_objective_upper_limit();
2475inline void GlopParameters::_internal_set_objective_upper_limit(
double value) {
2476 _has_bits_[1] |= 0x00000002u;
2477 objective_upper_limit_ =
value;
2480 _internal_set_objective_upper_limit(
value);
2485inline bool GlopParameters::_internal_has_degenerate_ministep_factor()
const {
2486 bool value = (_has_bits_[1] & 0x00000080u) != 0;
2490 return _internal_has_degenerate_ministep_factor();
2493 degenerate_ministep_factor_ = 0.01;
2494 _has_bits_[1] &= ~0x00000080u;
2496inline double GlopParameters::_internal_degenerate_ministep_factor()
const {
2497 return degenerate_ministep_factor_;
2501 return _internal_degenerate_ministep_factor();
2503inline void GlopParameters::_internal_set_degenerate_ministep_factor(
double value) {
2504 _has_bits_[1] |= 0x00000080u;
2505 degenerate_ministep_factor_ =
value;
2508 _internal_set_degenerate_ministep_factor(
value);
2513inline bool GlopParameters::_internal_has_random_seed()
const {
2514 bool value = (_has_bits_[1] & 0x00000040u) != 0;
2518 return _internal_has_random_seed();
2522 _has_bits_[1] &= ~0x00000040u;
2524inline ::PROTOBUF_NAMESPACE_ID::int32 GlopParameters::_internal_random_seed()
const {
2525 return random_seed_;
2529 return _internal_random_seed();
2531inline void GlopParameters::_internal_set_random_seed(::PROTOBUF_NAMESPACE_ID::int32
value) {
2532 _has_bits_[1] |= 0x00000040u;
2533 random_seed_ =
value;
2536 _internal_set_random_seed(
value);
2541inline bool GlopParameters::_internal_has_num_omp_threads()
const {
2542 bool value = (_has_bits_[1] & 0x00000400u) != 0;
2546 return _internal_has_num_omp_threads();
2549 num_omp_threads_ = 1;
2550 _has_bits_[1] &= ~0x00000400u;
2552inline ::PROTOBUF_NAMESPACE_ID::int32 GlopParameters::_internal_num_omp_threads()
const {
2553 return num_omp_threads_;
2557 return _internal_num_omp_threads();
2559inline void GlopParameters::_internal_set_num_omp_threads(::PROTOBUF_NAMESPACE_ID::int32
value) {
2560 _has_bits_[1] |= 0x00000400u;
2561 num_omp_threads_ =
value;
2564 _internal_set_num_omp_threads(
value);
2569inline bool GlopParameters::_internal_has_perturb_costs_in_dual_simplex()
const {
2570 bool value = (_has_bits_[0] & 0x00000004u) != 0;
2574 return _internal_has_perturb_costs_in_dual_simplex();
2577 perturb_costs_in_dual_simplex_ =
false;
2578 _has_bits_[0] &= ~0x00000004u;
2580inline bool GlopParameters::_internal_perturb_costs_in_dual_simplex()
const {
2581 return perturb_costs_in_dual_simplex_;
2585 return _internal_perturb_costs_in_dual_simplex();
2587inline void GlopParameters::_internal_set_perturb_costs_in_dual_simplex(
bool value) {
2588 _has_bits_[0] |= 0x00000004u;
2589 perturb_costs_in_dual_simplex_ =
value;
2592 _internal_set_perturb_costs_in_dual_simplex(
value);
2597inline bool GlopParameters::_internal_has_use_dedicated_dual_feasibility_algorithm()
const {
2598 bool value = (_has_bits_[1] & 0x00001000u) != 0;
2602 return _internal_has_use_dedicated_dual_feasibility_algorithm();
2605 use_dedicated_dual_feasibility_algorithm_ =
true;
2606 _has_bits_[1] &= ~0x00001000u;
2608inline bool GlopParameters::_internal_use_dedicated_dual_feasibility_algorithm()
const {
2609 return use_dedicated_dual_feasibility_algorithm_;
2613 return _internal_use_dedicated_dual_feasibility_algorithm();
2615inline void GlopParameters::_internal_set_use_dedicated_dual_feasibility_algorithm(
bool value) {
2616 _has_bits_[1] |= 0x00001000u;
2617 use_dedicated_dual_feasibility_algorithm_ =
value;
2620 _internal_set_use_dedicated_dual_feasibility_algorithm(
value);
2625inline bool GlopParameters::_internal_has_relative_cost_perturbation()
const {
2626 bool value = (_has_bits_[1] & 0x00004000u) != 0;
2630 return _internal_has_relative_cost_perturbation();
2633 relative_cost_perturbation_ = 1e-05;
2634 _has_bits_[1] &= ~0x00004000u;
2636inline double GlopParameters::_internal_relative_cost_perturbation()
const {
2637 return relative_cost_perturbation_;
2641 return _internal_relative_cost_perturbation();
2643inline void GlopParameters::_internal_set_relative_cost_perturbation(
double value) {
2644 _has_bits_[1] |= 0x00004000u;
2645 relative_cost_perturbation_ =
value;
2648 _internal_set_relative_cost_perturbation(
value);
2653inline bool GlopParameters::_internal_has_relative_max_cost_perturbation()
const {
2654 bool value = (_has_bits_[1] & 0x00008000u) != 0;
2658 return _internal_has_relative_max_cost_perturbation();
2661 relative_max_cost_perturbation_ = 1e-07;
2662 _has_bits_[1] &= ~0x00008000u;
2664inline double GlopParameters::_internal_relative_max_cost_perturbation()
const {
2665 return relative_max_cost_perturbation_;
2669 return _internal_relative_max_cost_perturbation();
2671inline void GlopParameters::_internal_set_relative_max_cost_perturbation(
double value) {
2672 _has_bits_[1] |= 0x00008000u;
2673 relative_max_cost_perturbation_ =
value;
2676 _internal_set_relative_max_cost_perturbation(
value);
2681inline bool GlopParameters::_internal_has_initial_condition_number_threshold()
const {
2682 bool value = (_has_bits_[1] & 0x00080000u) != 0;
2686 return _internal_has_initial_condition_number_threshold();
2689 initial_condition_number_threshold_ = 1e+50;
2690 _has_bits_[1] &= ~0x00080000u;
2692inline double GlopParameters::_internal_initial_condition_number_threshold()
const {
2693 return initial_condition_number_threshold_;
2697 return _internal_initial_condition_number_threshold();
2699inline void GlopParameters::_internal_set_initial_condition_number_threshold(
double value) {
2700 _has_bits_[1] |= 0x00080000u;
2701 initial_condition_number_threshold_ =
value;
2704 _internal_set_initial_condition_number_threshold(
value);
2709inline bool GlopParameters::_internal_has_log_search_progress()
const {
2710 bool value = (_has_bits_[0] & 0x00000008u) != 0;
2714 return _internal_has_log_search_progress();
2717 log_search_progress_ =
false;
2718 _has_bits_[0] &= ~0x00000008u;
2720inline bool GlopParameters::_internal_log_search_progress()
const {
2721 return log_search_progress_;
2725 return _internal_log_search_progress();
2727inline void GlopParameters::_internal_set_log_search_progress(
bool value) {
2728 _has_bits_[0] |= 0x00000008u;
2729 log_search_progress_ =
value;
2732 _internal_set_log_search_progress(
value);
2737inline bool GlopParameters::_internal_has_crossover_bound_snapping_distance()
const {
2738 bool value = (_has_bits_[1] & 0x00100000u) != 0;
2742 return _internal_has_crossover_bound_snapping_distance();
2745 crossover_bound_snapping_distance_ = std::numeric_limits<double>::infinity();
2746 _has_bits_[1] &= ~0x00100000u;
2748inline double GlopParameters::_internal_crossover_bound_snapping_distance()
const {
2749 return crossover_bound_snapping_distance_;
2753 return _internal_crossover_bound_snapping_distance();
2755inline void GlopParameters::_internal_set_crossover_bound_snapping_distance(
double value) {
2756 _has_bits_[1] |= 0x00100000u;
2757 crossover_bound_snapping_distance_ =
value;
2760 _internal_set_crossover_bound_snapping_distance(
value);
2765inline bool GlopParameters::_internal_has_push_to_vertex()
const {
2766 bool value = (_has_bits_[1] & 0x00002000u) != 0;
2770 return _internal_has_push_to_vertex();
2773 push_to_vertex_ =
true;
2774 _has_bits_[1] &= ~0x00002000u;
2776inline bool GlopParameters::_internal_push_to_vertex()
const {
2777 return push_to_vertex_;
2781 return _internal_push_to_vertex();
2783inline void GlopParameters::_internal_set_push_to_vertex(
bool value) {
2784 _has_bits_[1] |= 0x00002000u;
2785 push_to_vertex_ =
value;
2788 _internal_set_push_to_vertex(
value);
2793 #pragma GCC diagnostic pop
2801PROTOBUF_NAMESPACE_OPEN
2805inline const EnumDescriptor* GetEnumDescriptor< ::operations_research::glop::GlopParameters_ScalingAlgorithm>() {
2810inline const EnumDescriptor* GetEnumDescriptor< ::operations_research::glop::GlopParameters_SolverBehavior>() {
2815inline const EnumDescriptor* GetEnumDescriptor< ::operations_research::glop::GlopParameters_PricingRule>() {
2820inline const EnumDescriptor* GetEnumDescriptor< ::operations_research::glop::GlopParameters_InitialBasisHeuristic>() {
2825inline const EnumDescriptor* GetEnumDescriptor< ::operations_research::glop::GlopParameters_CostScalingAlgorithm>() {
2829PROTOBUF_NAMESPACE_CLOSE
2833#include <google/protobuf/port_undef.inc>
::operations_research::glop::GlopParameters_SolverBehavior solve_dual_problem() const
bool has_solve_dual_problem() const
void set_lu_factorization_pivot_threshold(double value)
double max_deterministic_time() const
void clear_initial_condition_number_threshold()
static constexpr int ScalingAlgorithm_ARRAYSIZE
void clear_num_omp_threads()
bool has_change_status_to_imprecise() const
static bool CostScalingAlgorithm_IsValid(int value)
static const std::string & InitialBasisHeuristic_Name(T enum_t_value)
GlopParameters(GlopParameters &&from) noexcept
bool initialize_devex_with_column_norms() const
bool use_dual_simplex() const
void clear_solve_dual_problem()
bool has_cost_scaling() const
bool has_max_number_of_iterations() const
double primal_feasibility_tolerance() const
void clear_recompute_reduced_costs_threshold()
static const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor * InitialBasisHeuristic_descriptor()
void set_optimization_rule(::operations_research::glop::GlopParameters_PricingRule value)
bool has_relative_max_cost_perturbation() const
static const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor * SolverBehavior_descriptor()
double recompute_edges_norm_threshold() const
void clear_objective_lower_limit()
bool has_solution_feasibility_tolerance() const
void clear_use_middle_product_form_update()
::operations_research::glop::GlopParameters_PricingRule feasibility_rule() const
double refactorization_threshold() const
bool log_search_progress() const
void clear_use_dedicated_dual_feasibility_algorithm()
static bool CostScalingAlgorithm_Parse(::PROTOBUF_NAMESPACE_ID::ConstStringParam name, CostScalingAlgorithm *value)
@ kObjectiveLowerLimitFieldNumber
@ kFeasibilityRuleFieldNumber
@ kCrossoverBoundSnappingDistanceFieldNumber
@ kUsePreprocessingFieldNumber
@ kPreprocessorZeroToleranceFieldNumber
@ kRefactorizationThresholdFieldNumber
@ kRelativeCostPerturbationFieldNumber
@ kInitializeDevexWithColumnNormsFieldNumber
@ kDropToleranceFieldNumber
@ kSolutionFeasibilityToleranceFieldNumber
@ kRatioTestZeroThresholdFieldNumber
@ kLogSearchProgressFieldNumber
@ kCostScalingFieldNumber
@ kBasisRefactorizationPeriodFieldNumber
@ kDualSmallPivotThresholdFieldNumber
@ kDualFeasibilityToleranceFieldNumber
@ kOptimizationRuleFieldNumber
@ kRelativeMaxCostPerturbationFieldNumber
@ kRecomputeEdgesNormThresholdFieldNumber
@ kLuFactorizationPivotThresholdFieldNumber
@ kMarkowitzZlatevParameterFieldNumber
@ kProvideStrongOptimalGuaranteeFieldNumber
@ kChangeStatusToImpreciseFieldNumber
@ kInitialBasisFieldNumber
@ kAllowSimplexAlgorithmChangeFieldNumber
@ kPerturbCostsInDualSimplexFieldNumber
@ kNumOmpThreadsFieldNumber
@ kDynamicallyAdjustRefactorizationPeriodFieldNumber
@ kHarrisToleranceRatioFieldNumber
@ kDevexWeightsResetPeriodFieldNumber
@ kUseMiddleProductFormUpdateFieldNumber
@ kExploitSingletonColumnInInitialBasisFieldNumber
@ kUseDualSimplexFieldNumber
@ kUseDedicatedDualFeasibilityAlgorithmFieldNumber
@ kMaxNumberOfIterationsFieldNumber
@ kDualizerThresholdFieldNumber
@ kInitialConditionNumberThresholdFieldNumber
@ kMarkowitzSingularityThresholdFieldNumber
@ kSolveDualProblemFieldNumber
@ kScalingMethodFieldNumber
@ kMaxDeterministicTimeFieldNumber
@ kPushToVertexFieldNumber
@ kMaxNumberOfReoptimizationsFieldNumber
@ kObjectiveUpperLimitFieldNumber
@ kUseTransposedMatrixFieldNumber
@ kMinimumAcceptablePivotFieldNumber
@ kMaxTimeInSecondsFieldNumber
@ kPrimalFeasibilityToleranceFieldNumber
@ kDegenerateMinistepFactorFieldNumber
@ kRecomputeReducedCostsThresholdFieldNumber
@ kSmallPivotThresholdFieldNumber
bool has_push_to_vertex() const
void set_harris_tolerance_ratio(double value)
bool allow_simplex_algorithm_change() const
static const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor * PricingRule_descriptor()
static constexpr SolverBehavior SolverBehavior_MAX
void clear_exploit_singleton_column_in_initial_basis()
static constexpr ScalingAlgorithm LINEAR_PROGRAM
double markowitz_singularity_threshold() const
void clear_max_deterministic_time()
void set_relative_cost_perturbation(double value)
static const GlopParameters & default_instance()
void set_markowitz_singularity_threshold(double value)
void clear_use_dual_simplex()
int GetCachedSize() const final
bool has_degenerate_ministep_factor() const
::operations_research::glop::GlopParameters_PricingRule optimization_rule() const
void clear_solution_feasibility_tolerance()
bool has_dualizer_threshold() const
void set_push_to_vertex(bool value)
static const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor * CostScalingAlgorithm_descriptor()
const char * _InternalParse(const char *ptr, ::PROTOBUF_NAMESPACE_ID::internal::ParseContext *ctx) final
bool has_random_seed() const
double dual_small_pivot_threshold() const
static constexpr InitialBasisHeuristic InitialBasisHeuristic_MAX
void set_dual_small_pivot_threshold(double value)
void clear_feasibility_rule()
bool has_use_transposed_matrix() const
void set_scaling_method(::operations_research::glop::GlopParameters_ScalingAlgorithm value)
bool has_use_dual_simplex() const
void clear_recompute_edges_norm_threshold()
bool use_dedicated_dual_feasibility_algorithm() const
bool has_allow_simplex_algorithm_change() const
bool has_ratio_test_zero_threshold() const
void set_max_number_of_iterations(::PROTOBUF_NAMESPACE_ID::int64 value)
void clear_small_pivot_threshold()
static const ClassData _class_data_
void clear_markowitz_singularity_threshold()
static constexpr InitialBasisHeuristic TRIANGULAR
static const std::string & CostScalingAlgorithm_Name(T enum_t_value)
double harris_tolerance_ratio() const
double max_number_of_reoptimizations() const
bool has_crossover_bound_snapping_distance() const
void clear_devex_weights_reset_period()
static const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor * ScalingAlgorithm_descriptor()
void clear_degenerate_ministep_factor()
void clear_initial_basis()
void clear_max_number_of_reoptimizations()
void set_allow_simplex_algorithm_change(bool value)
static constexpr int SolverBehavior_ARRAYSIZE
static constexpr CostScalingAlgorithm MEAN_COST_SCALING
::PROTOBUF_NAMESPACE_ID::int32 markowitz_zlatev_parameter() const
static constexpr PricingRule STEEPEST_EDGE
void set_solve_dual_problem(::operations_research::glop::GlopParameters_SolverBehavior value)
static constexpr ScalingAlgorithm EQUILIBRATION
void set_initialize_devex_with_column_norms(bool value)
void clear_change_status_to_imprecise()
bool change_status_to_imprecise() const
static constexpr ScalingAlgorithm DEFAULT
bool has_initialize_devex_with_column_norms() const
void set_recompute_edges_norm_threshold(double value)
static constexpr PricingRule PricingRule_MIN
void clear_relative_max_cost_perturbation()
bool use_middle_product_form_update() const
::PROTOBUF_NAMESPACE_ID::int32 random_seed() const
bool has_recompute_edges_norm_threshold() const
void set_ratio_test_zero_threshold(double value)
bool has_feasibility_rule() const
void clear_push_to_vertex()
double drop_tolerance() const
bool use_transposed_matrix() const
double preprocessor_zero_tolerance() const
void set_minimum_acceptable_pivot(double value)
static constexpr SolverBehavior LET_SOLVER_DECIDE
void clear_perturb_costs_in_dual_simplex()
static bool ScalingAlgorithm_IsValid(int value)
void clear_initialize_devex_with_column_norms()
void clear_drop_tolerance()
::operations_research::glop::GlopParameters_ScalingAlgorithm scaling_method() const
double minimum_acceptable_pivot() const
void clear_refactorization_threshold()
void clear_use_preprocessing()
void set_use_transposed_matrix(bool value)
static bool SolverBehavior_IsValid(int value)
void clear_provide_strong_optimal_guarantee()
GlopParameters * New(::PROTOBUF_NAMESPACE_ID::Arena *arena) const final
void UnsafeArenaSwap(GlopParameters *other)
bool has_initial_basis() const
bool has_use_middle_product_form_update() const
static bool InitialBasisHeuristic_IsValid(int value)
::PROTOBUF_NAMESPACE_ID::int32 devex_weights_reset_period() const
double dual_feasibility_tolerance() const
static constexpr SolverBehavior NEVER_DO
::PROTOBUF_NAMESPACE_ID::int32 basis_refactorization_period() const
bool perturb_costs_in_dual_simplex() const
bool has_max_number_of_reoptimizations() const
double initial_condition_number_threshold() const
void set_dual_feasibility_tolerance(double value)
void set_cost_scaling(::operations_research::glop::GlopParameters_CostScalingAlgorithm value)
bool has_optimization_rule() const
double ratio_test_zero_threshold() const
void clear_max_number_of_iterations()
static constexpr int InitialBasisHeuristic_ARRAYSIZE
double solution_feasibility_tolerance() const
bool dynamically_adjust_refactorization_period() const
bool IsInitialized() const final
const ::PROTOBUF_NAMESPACE_ID::UnknownFieldSet & unknown_fields() const
double dualizer_threshold() const
void set_dualizer_threshold(double value)
void set_drop_tolerance(double value)
static constexpr int kIndexInFileMessages
bool has_basis_refactorization_period() const
bool has_objective_upper_limit() const
static constexpr int PricingRule_ARRAYSIZE
GlopParameters_SolverBehavior SolverBehavior
bool has_primal_feasibility_tolerance() const
void set_max_deterministic_time(double value)
static constexpr InitialBasisHeuristic NONE
double crossover_bound_snapping_distance() const
bool has_minimum_acceptable_pivot() const
static constexpr SolverBehavior ALWAYS_DO
bool has_small_pivot_threshold() const
bool has_use_scaling() const
static bool PricingRule_IsValid(int value)
static const ::PROTOBUF_NAMESPACE_ID::Descriptor * GetDescriptor()
double lu_factorization_pivot_threshold() const
static constexpr CostScalingAlgorithm CostScalingAlgorithm_MIN
void set_max_number_of_reoptimizations(double value)
void clear_relative_cost_perturbation()
friend void swap(GlopParameters &a, GlopParameters &b)
void set_feasibility_rule(::operations_research::glop::GlopParameters_PricingRule value)
void set_exploit_singleton_column_in_initial_basis(bool value)
void set_refactorization_threshold(double value)
double relative_cost_perturbation() const
void set_objective_lower_limit(double value)
::PROTOBUF_NAMESPACE_ID::int64 max_number_of_iterations() const
double relative_max_cost_perturbation() const
bool has_relative_cost_perturbation() const
void clear_minimum_acceptable_pivot()
void set_provide_strong_optimal_guarantee(bool value)
GlopParameters * New() const final
double objective_lower_limit() const
void clear_preprocessor_zero_tolerance()
void set_markowitz_zlatev_parameter(::PROTOBUF_NAMESPACE_ID::int32 value)
bool has_max_time_in_seconds() const
void clear_dualizer_threshold()
void MergeFrom(const GlopParameters &from)
void clear_objective_upper_limit()
GlopParameters & operator=(GlopParameters &&from) noexcept
PROTOBUF_ATTRIBUTE_REINITIALIZES void Clear() final
void set_random_seed(::PROTOBUF_NAMESPACE_ID::int32 value)
GlopParameters_PricingRule PricingRule
void set_initial_basis(::operations_research::glop::GlopParameters_InitialBasisHeuristic value)
static const GlopParameters * internal_default_instance()
static constexpr CostScalingAlgorithm CostScalingAlgorithm_MAX
void clear_log_search_progress()
const ::PROTOBUF_NAMESPACE_ID::Message::ClassData * GetClassData() const final
bool has_refactorization_threshold() const
void Swap(GlopParameters *other)
bool has_use_dedicated_dual_feasibility_algorithm() const
void set_use_preprocessing(bool value)
double degenerate_ministep_factor() const
bool has_recompute_reduced_costs_threshold() const
void set_use_scaling(bool value)
void set_log_search_progress(bool value)
void clear_ratio_test_zero_threshold()
void set_devex_weights_reset_period(::PROTOBUF_NAMESPACE_ID::int32 value)
bool has_max_deterministic_time() const
static constexpr SolverBehavior SolverBehavior_MIN
bool has_preprocessor_zero_tolerance() const
void clear_cost_scaling()
::PROTOBUF_NAMESPACE_ID::Metadata GetMetadata() const final
static constexpr ScalingAlgorithm ScalingAlgorithm_MAX
bool has_drop_tolerance() const
static const std::string & PricingRule_Name(T enum_t_value)
static const ::PROTOBUF_NAMESPACE_ID::Descriptor * descriptor()
void clear_max_time_in_seconds()
~GlopParameters() override
double small_pivot_threshold() const
bool has_dual_small_pivot_threshold() const
bool has_markowitz_zlatev_parameter() const
void CopyFrom(const GlopParameters &from)
double recompute_reduced_costs_threshold() const
bool has_dynamically_adjust_refactorization_period() const
bool has_use_preprocessing() const
void clear_dual_feasibility_tolerance()
static bool ScalingAlgorithm_Parse(::PROTOBUF_NAMESPACE_ID::ConstStringParam name, ScalingAlgorithm *value)
void clear_markowitz_zlatev_parameter()
static constexpr ScalingAlgorithm ScalingAlgorithm_MIN
double max_time_in_seconds() const
void clear_lu_factorization_pivot_threshold()
void clear_basis_refactorization_period()
bool has_markowitz_singularity_threshold() const
double objective_upper_limit() const
void set_basis_refactorization_period(::PROTOBUF_NAMESPACE_ID::int32 value)
bool has_dual_feasibility_tolerance() const
void set_objective_upper_limit(double value)
bool exploit_singleton_column_in_initial_basis() const
void set_dynamically_adjust_refactorization_period(bool value)
bool has_objective_lower_limit() const
bool has_provide_strong_optimal_guarantee() const
bool has_log_search_progress() const
static constexpr CostScalingAlgorithm NO_COST_SCALING
static bool InitialBasisHeuristic_Parse(::PROTOBUF_NAMESPACE_ID::ConstStringParam name, InitialBasisHeuristic *value)
void set_relative_max_cost_perturbation(double value)
void set_use_dedicated_dual_feasibility_algorithm(bool value)
void clear_optimization_rule()
::operations_research::glop::GlopParameters_InitialBasisHeuristic initial_basis() const
static const std::string & ScalingAlgorithm_Name(T enum_t_value)
GlopParameters_InitialBasisHeuristic InitialBasisHeuristic
bool has_harris_tolerance_ratio() const
bool use_preprocessing() const
void clear_allow_simplex_algorithm_change()
void set_max_time_in_seconds(double value)
static constexpr PricingRule DANTZIG
inline ::PROTOBUF_NAMESPACE_ID::UnknownFieldSet * mutable_unknown_fields()
void clear_crossover_bound_snapping_distance()
static constexpr InitialBasisHeuristic BIXBY
static const std::string & SolverBehavior_Name(T enum_t_value)
bool has_num_omp_threads() const
void set_change_status_to_imprecise(bool value)
void set_small_pivot_threshold(double value)
void set_crossover_bound_snapping_distance(double value)
void set_perturb_costs_in_dual_simplex(bool value)
void set_initial_condition_number_threshold(double value)
GlopParameters & operator=(const GlopParameters &from)
void set_degenerate_ministep_factor(double value)
static constexpr InitialBasisHeuristic MAROS
bool has_lu_factorization_pivot_threshold() const
void set_recompute_reduced_costs_threshold(double value)
bool provide_strong_optimal_guarantee() const
void clear_dynamically_adjust_refactorization_period()
static const ::PROTOBUF_NAMESPACE_ID::Reflection * GetReflection()
void set_primal_feasibility_tolerance(double value)
static constexpr InitialBasisHeuristic InitialBasisHeuristic_MIN
void clear_primal_feasibility_tolerance()
static constexpr CostScalingAlgorithm MEDIAN_COST_SCALING
void set_num_omp_threads(::PROTOBUF_NAMESPACE_ID::int32 value)
bool has_devex_weights_reset_period() const
void set_preprocessor_zero_tolerance(double value)
bool has_exploit_singleton_column_in_initial_basis() const
void set_use_middle_product_form_update(bool value)
void clear_harris_tolerance_ratio()
::operations_research::glop::GlopParameters_CostScalingAlgorithm cost_scaling() const
bool has_perturb_costs_in_dual_simplex() const
static constexpr PricingRule PricingRule_MAX
size_t ByteSizeLong() const final
static constexpr PricingRule DEVEX
void clear_use_transposed_matrix()
void set_use_dual_simplex(bool value)
GlopParameters_CostScalingAlgorithm CostScalingAlgorithm
void clear_scaling_method()
void set_solution_feasibility_tolerance(double value)
::PROTOBUF_NAMESPACE_ID::int32 num_omp_threads() const
void clear_dual_small_pivot_threshold()
static bool PricingRule_Parse(::PROTOBUF_NAMESPACE_ID::ConstStringParam name, PricingRule *value)
static bool SolverBehavior_Parse(::PROTOBUF_NAMESPACE_ID::ConstStringParam name, SolverBehavior *value)
bool has_scaling_method() const
bool push_to_vertex() const
static constexpr int CostScalingAlgorithm_ARRAYSIZE
bool has_initial_condition_number_threshold() const
::PROTOBUF_NAMESPACE_ID::uint8 * _InternalSerialize(::PROTOBUF_NAMESPACE_ID::uint8 *target, ::PROTOBUF_NAMESPACE_ID::io::EpsCopyOutputStream *stream) const final
static constexpr CostScalingAlgorithm CONTAIN_ONE_COST_SCALING
const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor * GlopParameters_PricingRule_descriptor()
constexpr GlopParameters_InitialBasisHeuristic GlopParameters_InitialBasisHeuristic_InitialBasisHeuristic_MAX
constexpr int GlopParameters_CostScalingAlgorithm_CostScalingAlgorithm_ARRAYSIZE
bool GlopParameters_CostScalingAlgorithm_IsValid(int value)
constexpr GlopParameters_PricingRule GlopParameters_PricingRule_PricingRule_MIN
bool GlopParameters_InitialBasisHeuristic_Parse(::PROTOBUF_NAMESPACE_ID::ConstStringParam name, GlopParameters_InitialBasisHeuristic *value)
constexpr int GlopParameters_SolverBehavior_SolverBehavior_ARRAYSIZE
GlopParameters_SolverBehavior
@ GlopParameters_SolverBehavior_ALWAYS_DO
@ GlopParameters_SolverBehavior_LET_SOLVER_DECIDE
@ GlopParameters_SolverBehavior_NEVER_DO
constexpr int GlopParameters_InitialBasisHeuristic_InitialBasisHeuristic_ARRAYSIZE
constexpr GlopParameters_ScalingAlgorithm GlopParameters_ScalingAlgorithm_ScalingAlgorithm_MIN
bool GlopParameters_CostScalingAlgorithm_Parse(::PROTOBUF_NAMESPACE_ID::ConstStringParam name, GlopParameters_CostScalingAlgorithm *value)
constexpr int GlopParameters_PricingRule_PricingRule_ARRAYSIZE
constexpr GlopParameters_ScalingAlgorithm GlopParameters_ScalingAlgorithm_ScalingAlgorithm_MAX
const std::string & GlopParameters_InitialBasisHeuristic_Name(T enum_t_value)
const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor * GlopParameters_ScalingAlgorithm_descriptor()
bool GlopParameters_InitialBasisHeuristic_IsValid(int value)
PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT GlopParametersDefaultTypeInternal _GlopParameters_default_instance_
constexpr GlopParameters_PricingRule GlopParameters_PricingRule_PricingRule_MAX
constexpr int GlopParameters_ScalingAlgorithm_ScalingAlgorithm_ARRAYSIZE
bool GlopParameters_SolverBehavior_IsValid(int value)
GlopParameters_ScalingAlgorithm
@ GlopParameters_ScalingAlgorithm_LINEAR_PROGRAM
@ GlopParameters_ScalingAlgorithm_EQUILIBRATION
@ GlopParameters_ScalingAlgorithm_DEFAULT
const std::string & GlopParameters_SolverBehavior_Name(T enum_t_value)
constexpr GlopParameters_CostScalingAlgorithm GlopParameters_CostScalingAlgorithm_CostScalingAlgorithm_MIN
const std::string & GlopParameters_ScalingAlgorithm_Name(T enum_t_value)
GlopParameters_PricingRule
@ GlopParameters_PricingRule_DANTZIG
@ GlopParameters_PricingRule_DEVEX
@ GlopParameters_PricingRule_STEEPEST_EDGE
const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor * GlopParameters_SolverBehavior_descriptor()
constexpr GlopParameters_CostScalingAlgorithm GlopParameters_CostScalingAlgorithm_CostScalingAlgorithm_MAX
constexpr GlopParameters_InitialBasisHeuristic GlopParameters_InitialBasisHeuristic_InitialBasisHeuristic_MIN
constexpr GlopParameters_SolverBehavior GlopParameters_SolverBehavior_SolverBehavior_MIN
GlopParameters_CostScalingAlgorithm
@ GlopParameters_CostScalingAlgorithm_MEAN_COST_SCALING
@ GlopParameters_CostScalingAlgorithm_NO_COST_SCALING
@ GlopParameters_CostScalingAlgorithm_MEDIAN_COST_SCALING
@ GlopParameters_CostScalingAlgorithm_CONTAIN_ONE_COST_SCALING
bool GlopParameters_ScalingAlgorithm_Parse(::PROTOBUF_NAMESPACE_ID::ConstStringParam name, GlopParameters_ScalingAlgorithm *value)
constexpr GlopParameters_SolverBehavior GlopParameters_SolverBehavior_SolverBehavior_MAX
bool GlopParameters_PricingRule_IsValid(int value)
bool GlopParameters_ScalingAlgorithm_IsValid(int value)
GlopParameters_InitialBasisHeuristic
@ GlopParameters_InitialBasisHeuristic_BIXBY
@ GlopParameters_InitialBasisHeuristic_TRIANGULAR
@ GlopParameters_InitialBasisHeuristic_NONE
@ GlopParameters_InitialBasisHeuristic_MAROS
const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor * GlopParameters_InitialBasisHeuristic_descriptor()
bool GlopParameters_SolverBehavior_Parse(::PROTOBUF_NAMESPACE_ID::ConstStringParam name, GlopParameters_SolverBehavior *value)
const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor * GlopParameters_CostScalingAlgorithm_descriptor()
const std::string & GlopParameters_CostScalingAlgorithm_Name(T enum_t_value)
const std::string & GlopParameters_PricingRule_Name(T enum_t_value)
bool GlopParameters_PricingRule_Parse(::PROTOBUF_NAMESPACE_ID::ConstStringParam name, GlopParameters_PricingRule *value)
Collection of objects used to extend the Constraint Solver library.
const ::PROTOBUF_NAMESPACE_ID::internal::DescriptorTable descriptor_table_ortools_2fglop_2fparameters_2eproto