Google OR-Tools v9.14
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
operations_research::sat::ImpliedBoundsProcessor::BestImpliedBoundInfo Struct Reference

#include <cuts.h>

Public Member Functions

double SlackLpValue (IntegerValue lb) const
std::string DebugString () const

Public Attributes

double var_lp_value = 0.0
double bool_lp_value = 0.0
IntegerValue implied_bound
IntegerVariable bool_var = kNoIntegerVariable

Detailed Description

Once RecomputeCacheAndSeparateSomeImpliedBoundCuts() has been called, we can get the best implied bound for each variables.

Note
because the variable level zero lower bound might change since the time this was cached, we just store the implied bound here.

Definition at line 263 of file cuts.h.

Member Function Documentation

◆ DebugString()

std::string operations_research::sat::ImpliedBoundsProcessor::BestImpliedBoundInfo::DebugString ( ) const
inline

Definition at line 278 of file cuts.h.

◆ SlackLpValue()

double operations_research::sat::ImpliedBoundsProcessor::BestImpliedBoundInfo::SlackLpValue ( IntegerValue lb) const
inline

Definition at line 272 of file cuts.h.

Member Data Documentation

◆ bool_lp_value

double operations_research::sat::ImpliedBoundsProcessor::BestImpliedBoundInfo::bool_lp_value = 0.0

Definition at line 265 of file cuts.h.

◆ bool_var

IntegerVariable operations_research::sat::ImpliedBoundsProcessor::BestImpliedBoundInfo::bool_var = kNoIntegerVariable

When VariableIsPositive(bool_var) then it is when this is one that the bound is implied. Otherwise it is when this is zero.

Definition at line 270 of file cuts.h.

◆ implied_bound

IntegerValue operations_research::sat::ImpliedBoundsProcessor::BestImpliedBoundInfo::implied_bound

Definition at line 266 of file cuts.h.

◆ var_lp_value

double operations_research::sat::ImpliedBoundsProcessor::BestImpliedBoundInfo::var_lp_value = 0.0

Definition at line 264 of file cuts.h.


The documentation for this struct was generated from the following file: