#include <linear_programming_constraint.h>
◆ ConstraintIndex
◆ LinearProgrammingConstraint()
| operations_research::sat::LinearProgrammingConstraint::LinearProgrammingConstraint |
( |
Model * | model, |
|
|
absl::Span< const IntegerVariable > | vars ) |
◆ ~LinearProgrammingConstraint()
| operations_research::sat::LinearProgrammingConstraint::~LinearProgrammingConstraint |
( |
| ) |
|
|
override |
◆ AddCutGenerator()
| void operations_research::sat::LinearProgrammingConstraint::AddCutGenerator |
( |
CutGenerator | generator | ) |
|
◆ AddLinearConstraint()
| bool operations_research::sat::LinearProgrammingConstraint::AddLinearConstraint |
( |
LinearConstraint | ct | ) |
|
◆ AtOptimal()
| bool operations_research::sat::LinearProgrammingConstraint::AtOptimal |
( |
| ) |
const |
|
inline |
◆ average_degeneracy()
| double operations_research::sat::LinearProgrammingConstraint::average_degeneracy |
( |
| ) |
const |
|
inline |
◆ ComputeNewLinearConstraint()
template<bool check_overflow>
| bool operations_research::sat::LinearProgrammingConstraint::ComputeNewLinearConstraint |
( |
absl::Span< const std::pair< RowIndex, IntegerValue > > | integer_multipliers, |
|
|
ScatteredIntegerVector * | scattered_vector, |
|
|
IntegerValue * | upper_bound ) const |
◆ constraint_manager()
| const LinearConstraintManager & operations_research::sat::LinearProgrammingConstraint::constraint_manager |
( |
| ) |
const |
|
inline |
◆ DimensionString()
| std::string operations_research::sat::LinearProgrammingConstraint::DimensionString |
( |
| ) |
const |
◆ EnablePropagation()
| void operations_research::sat::LinearProgrammingConstraint::EnablePropagation |
( |
bool | enable | ) |
|
|
inline |
◆ GetBasisState()
| const glop::BasisState & operations_research::sat::LinearProgrammingConstraint::GetBasisState |
( |
| ) |
const |
|
inline |
◆ GetSolutionValue()
| double operations_research::sat::LinearProgrammingConstraint::GetSolutionValue |
( |
IntegerVariable | variable | ) |
const |
◆ HasSolution()
| bool operations_research::sat::LinearProgrammingConstraint::HasSolution |
( |
| ) |
const |
|
inline |
◆ HeuristicLpReducedCostAverageBranching()
| std::function< IntegerLiteral()> operations_research::sat::LinearProgrammingConstraint::HeuristicLpReducedCostAverageBranching |
( |
| ) |
|
◆ IncrementalPropagate()
| bool operations_research::sat::LinearProgrammingConstraint::IncrementalPropagate |
( |
const std::vector< int > & | watch_indices | ) |
|
|
overridevirtual |
◆ integer_variables()
| const std::vector< IntegerVariable > & operations_research::sat::LinearProgrammingConstraint::integer_variables |
( |
| ) |
const |
|
inline |
◆ LatestOptimalConstraintOrNull()
| IntegerSumLE128 * operations_research::sat::LinearProgrammingConstraint::LatestOptimalConstraintOrNull |
( |
| ) |
const |
|
inline |
◆ LoadBasisState()
| void operations_research::sat::LinearProgrammingConstraint::LoadBasisState |
( |
const glop::BasisState & | state | ) |
|
|
inline |
◆ num_adjusts()
| int64_t operations_research::sat::LinearProgrammingConstraint::num_adjusts |
( |
| ) |
const |
|
inline |
◆ num_bad_cuts()
| int64_t operations_research::sat::LinearProgrammingConstraint::num_bad_cuts |
( |
| ) |
const |
|
inline |
◆ num_cut_overflows()
| int64_t operations_research::sat::LinearProgrammingConstraint::num_cut_overflows |
( |
| ) |
const |
|
inline |
◆ num_lp_changes()
| int64_t operations_research::sat::LinearProgrammingConstraint::num_lp_changes |
( |
| ) |
const |
|
inline |
◆ num_scaling_issues()
| int64_t operations_research::sat::LinearProgrammingConstraint::num_scaling_issues |
( |
| ) |
const |
|
inline |
◆ num_solves()
| int64_t operations_research::sat::LinearProgrammingConstraint::num_solves |
( |
| ) |
const |
|
inline |
◆ num_solves_by_status()
| const std::vector< int64_t > & operations_research::sat::LinearProgrammingConstraint::num_solves_by_status |
( |
| ) |
const |
|
inline |
◆ NumVariables()
| int operations_research::sat::LinearProgrammingConstraint::NumVariables |
( |
| ) |
const |
|
inline |
◆ ObjectiveLpLowerBound()
| double operations_research::sat::LinearProgrammingConstraint::ObjectiveLpLowerBound |
( |
| ) |
const |
|
inline |
◆ ObjectiveVariable()
| IntegerVariable operations_research::sat::LinearProgrammingConstraint::ObjectiveVariable |
( |
| ) |
const |
|
inline |
◆ OptimalConstraints()
| const std::vector< std::unique_ptr< IntegerSumLE128 > > & operations_research::sat::LinearProgrammingConstraint::OptimalConstraints |
( |
| ) |
const |
|
inline |
◆ Propagate()
| bool operations_research::sat::LinearProgrammingConstraint::Propagate |
( |
| ) |
|
|
overridevirtual |
◆ PropagationIsEnabled()
| bool operations_research::sat::LinearProgrammingConstraint::PropagationIsEnabled |
( |
| ) |
const |
|
inline |
◆ RegisterWith()
| void operations_research::sat::LinearProgrammingConstraint::RegisterWith |
( |
Model * | model | ) |
|
◆ SetLevel()
| void operations_research::sat::LinearProgrammingConstraint::SetLevel |
( |
int | level | ) |
|
|
overridevirtual |
◆ SetMainObjectiveVariable()
| void operations_research::sat::LinearProgrammingConstraint::SetMainObjectiveVariable |
( |
IntegerVariable | ivar | ) |
|
|
inline |
◆ SetObjectiveCoefficient()
| void operations_research::sat::LinearProgrammingConstraint::SetObjectiveCoefficient |
( |
IntegerVariable | ivar, |
|
|
IntegerValue | coeff ) |
◆ SolutionIsInteger()
| bool operations_research::sat::LinearProgrammingConstraint::SolutionIsInteger |
( |
| ) |
const |
|
inline |
◆ total_num_cut_propagations()
| int64_t operations_research::sat::LinearProgrammingConstraint::total_num_cut_propagations |
( |
| ) |
const |
|
inline |
◆ total_num_eq_propagations()
| int64_t operations_research::sat::LinearProgrammingConstraint::total_num_eq_propagations |
( |
| ) |
const |
|
inline |
◆ total_num_simplex_iterations()
| int64_t operations_research::sat::LinearProgrammingConstraint::total_num_simplex_iterations |
( |
| ) |
const |
|
inline |
The documentation for this class was generated from the following files: