Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
cp_model_checker.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_SAT_CP_MODEL_CHECKER_H_
15#define OR_TOOLS_SAT_CP_MODEL_CHECKER_H_
16
17#include <cstdint>
18#include <string>
19#include <vector>
20
21#include "absl/types/span.h"
22#include "ortools/base/types.h"
23#include "ortools/sat/cp_model.pb.h"
24#include "ortools/sat/sat_parameters.pb.h"
25
26namespace operations_research {
27namespace sat {
28
29// Verifies that the given model satisfies all the properties described in the
30// proto comments. Returns an empty string if it is the case, otherwise fails at
31// the first error and returns a human-readable description of the issue.
32//
33// The extra parameter is internal and mainly for debugging. After the problem
34// has been presolved, we have a stricter set of properties we want to enforce.
35//
36// TODO(user): Add any needed overflow validation because we are far from
37// exhaustive. We could also run a small presolve that tighten variable bounds
38// before the overflow check to facilitate the lives of our users, but it is a
39// some work to put in place.
40std::string ValidateCpModel(const CpModelProto& model,
41 bool after_presolve = false);
42
43// Some validation (in particular the floating point objective) requires to
44// read parameters.
45//
46// TODO(user): Ideally we would have just one ValidateCpModel() function but
47// this was introduced after many users already use ValidateCpModel() without
48// parameters.
49std::string ValidateInputCpModel(const SatParameters& params,
50 const CpModelProto& model);
51
52// Check if a given linear expression can create overflow. It is exposed to test
53// new constraints created during the presolve.
54bool PossibleIntegerOverflow(const CpModelProto& model,
55 absl::Span<const int> vars,
56 absl::Span<const int64_t> coeffs,
57 int64_t offset = 0);
58
59// Verifies that the given variable assignment is a feasible solution of the
60// given model. The values vector should be in one to one correspondence with
61// the model.variables() list of variables.
62//
63// The last two arguments are optional and help debugging a failing constraint
64// due to presolve.
65bool SolutionIsFeasible(const CpModelProto& model,
66 absl::Span<const int64_t> variable_values,
67 const CpModelProto* mapping_proto = nullptr,
68 const std::vector<int>* postsolve_mapping = nullptr);
69
70// Checks a single constraint for feasibility.
71// This has some overhead, and should only be used for debugging.
72// The full model is needed for scheduling constraints that refers to intervals.
73bool ConstraintIsFeasible(const CpModelProto& model,
74 const ConstraintProto& constraint,
75 absl::Span<const int64_t> variable_values);
76
77} // namespace sat
78} // namespace operations_research
79
80#endif // OR_TOOLS_SAT_CP_MODEL_CHECKER_H_
GRBmodel * model
std::string ValidateInputCpModel(const SatParameters &params, const CpModelProto &model)
std::string ValidateCpModel(const CpModelProto &model, bool after_presolve)
bool SolutionIsFeasible(const CpModelProto &model, absl::Span< const int64_t > variable_values, const CpModelProto *mapping_proto, const std::vector< int > *postsolve_mapping)
bool ConstraintIsFeasible(const CpModelProto &model, const ConstraintProto &constraint, absl::Span< const int64_t > variable_values)
bool PossibleIntegerOverflow(const CpModelProto &model, absl::Span< const int > vars, absl::Span< const int64_t > coeffs, int64_t offset)
In SWIG mode, we don't want anything besides these top-level includes.