Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
glop_solver.h
Go to the documentation of this file.
1// Copyright 2010-2024 Google LLC
2// Licensed under the Apache License, Version 2.0 (the "License");
3// you may not use this file except in compliance with the License.
4// You may obtain a copy of the License at
5//
6// http://www.apache.org/licenses/LICENSE-2.0
7//
8// Unless required by applicable law or agreed to in writing, software
9// distributed under the License is distributed on an "AS IS" BASIS,
10// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
11// See the License for the specific language governing permissions and
12// limitations under the License.
13
14#ifndef OR_TOOLS_MATH_OPT_SOLVERS_GLOP_SOLVER_H_
15#define OR_TOOLS_MATH_OPT_SOLVERS_GLOP_SOLVER_H_
16
17#include <stdint.h>
18
19#include <memory>
20
21#include "absl/container/flat_hash_map.h"
22#include "absl/status/status.h"
23#include "absl/status/statusor.h"
24#include "absl/time/time.h"
25#include "absl/types/span.h"
27#include "ortools/glop/parameters.pb.h"
30#include "ortools/math_opt/callback.pb.h"
33#include "ortools/math_opt/infeasible_subsystem.pb.h"
34#include "ortools/math_opt/model.pb.h"
35#include "ortools/math_opt/model_parameters.pb.h"
36#include "ortools/math_opt/model_update.pb.h"
37#include "ortools/math_opt/parameters.pb.h"
38#include "ortools/math_opt/result.pb.h"
39#include "ortools/math_opt/solution.pb.h"
40#include "ortools/math_opt/sparse_containers.pb.h"
42
43namespace operations_research {
44namespace math_opt {
45
47 public:
48 static absl::StatusOr<std::unique_ptr<SolverInterface>> New(
49 const ModelProto& model, const InitArgs& init_args);
50
51 absl::StatusOr<SolveResultProto> Solve(
52 const SolveParametersProto& parameters,
53 const ModelSolveParametersProto& model_parameters,
54 MessageCallback message_cb,
55 const CallbackRegistrationProto& callback_registration, Callback cb,
56 const SolveInterrupter* interrupter) override;
57 absl::StatusOr<bool> Update(const ModelUpdateProto& model_update) override;
58 absl::StatusOr<ComputeInfeasibleSubsystemResultProto>
59 ComputeInfeasibleSubsystem(const SolveParametersProto& parameters,
60 MessageCallback message_cb,
61 const SolveInterrupter* interrupter) override;
62
63 // Returns the merged parameters and a list of warnings from any parameter
64 // settings that are invalid for this solver.
65 static absl::StatusOr<glop::GlopParameters> MergeSolveParameters(
66 const SolveParametersProto& solve_parameters, bool setting_initial_basis,
67 bool has_message_callback, bool is_maximization);
68
69 private:
70 GlopSolver();
71
72 void AddVariables(const VariablesProto& variables);
73 void AddLinearConstraints(const LinearConstraintsProto& linear_constraints);
74
75 void DeleteVariables(absl::Span<const int64_t> ids_to_delete);
76 void DeleteLinearConstraints(absl::Span<const int64_t> ids_to_delete);
77
78 void SetOrUpdateObjectiveCoefficients(
79 const SparseDoubleVectorProto& linear_objective_coefficients);
80 void SetOrUpdateConstraintMatrix(
81 const SparseDoubleMatrixProto& linear_constraint_matrix);
82
83 void UpdateVariableBounds(const VariableUpdatesProto& variable_updates);
84 void UpdateLinearConstraintBounds(
85 const LinearConstraintUpdatesProto& linear_constraint_updates);
86
87 // Returns the ids of variables and linear constraints with inverted bounds.
88 InvertedBounds ListInvertedBounds() const;
89
90 void FillSolution(glop::ProblemStatus status,
91 const ModelSolveParametersProto& model_parameters,
92 SolveResultProto& solve_result);
93 absl::StatusOr<SolveResultProto> MakeSolveResult(
95 const ModelSolveParametersProto& model_parameters,
96 const SolveInterrupter* interrupter, absl::Duration solve_time);
97
98 absl::Status FillSolveStats(absl::Duration solve_time,
99 SolveStatsProto& solve_stats);
100
101 void SetGlopBasis(const BasisProto& basis);
102
103 glop::LinearProgram linear_program_;
104 glop::LPSolver lp_solver_;
105
106 absl::flat_hash_map<int64_t, glop::ColIndex> variables_;
107 absl::flat_hash_map<int64_t, glop::RowIndex> linear_constraints_;
108};
109
110} // namespace math_opt
111} // namespace operations_research
112
113#endif // OR_TOOLS_MATH_OPT_SOLVERS_GLOP_SOLVER_H_
A full-fledged linear programming solver.
Definition lp_solver.h:31
absl::StatusOr< bool > Update(const ModelUpdateProto &model_update) override
absl::StatusOr< SolveResultProto > Solve(const SolveParametersProto &parameters, const ModelSolveParametersProto &model_parameters, MessageCallback message_cb, const CallbackRegistrationProto &callback_registration, Callback cb, const SolveInterrupter *interrupter) override
absl::StatusOr< ComputeInfeasibleSubsystemResultProto > ComputeInfeasibleSubsystem(const SolveParametersProto &parameters, MessageCallback message_cb, const SolveInterrupter *interrupter) override
static absl::StatusOr< glop::GlopParameters > MergeSolveParameters(const SolveParametersProto &solve_parameters, bool setting_initial_basis, bool has_message_callback, bool is_maximization)
static absl::StatusOr< std::unique_ptr< SolverInterface > > New(const ModelProto &model, const InitArgs &init_args)
std::function< void(const std::vector< std::string > &)> MessageCallback
std::function< absl::StatusOr< CallbackResultProto >( const CallbackDataProto &)> Callback
SatParameters parameters
absl::Status status
Definition g_gurobi.cc:44
GRBmodel * model
ProblemStatus
Different statuses for a given problem.
Definition lp_types.h:107
In SWIG mode, we don't want anything besides these top-level includes.