Definition at line 53 of file reduced_costs.h.
#include <reduced_costs.h>
|
| | ReducedCosts (const CompactSparseMatrix &matrix_, const DenseRow &objective, const RowToColMapping &basis, const VariablesInfo &variables_info, const BasisFactorization &basis_factorization, absl::BitGenRef random) |
| | ReducedCosts (const ReducedCosts &)=delete |
| ReducedCosts & | operator= (const ReducedCosts &)=delete |
| bool | NeedsBasisRefactorization () const |
| void | SetRandom (absl::BitGenRef random) |
| Fractional | TestEnteringReducedCostPrecision (ColIndex entering_col, const ScatteredColumn &direction) |
| Fractional | ComputeMaximumDualResidual () |
| Fractional | ComputeMaximumDualInfeasibility () |
| Fractional | ComputeSumOfDualInfeasibilities () |
| Fractional | ComputeMaximumDualInfeasibilityOnNonBoxedVariables () |
| void | UpdateBeforeBasisPivot (ColIndex entering_col, RowIndex leaving_row, const ScatteredColumn &direction, UpdateRow *update_row) |
| void | SetNonBasicVariableCostToZero (ColIndex col, Fractional *current_cost) |
| void | SetParameters (const GlopParameters ¶meters) |
| bool | AreReducedCostsPrecise () |
| bool | AreReducedCostsRecomputed () |
| void | MakeReducedCostsPrecise () |
| void | PerturbCosts () |
| void | ShiftCostIfNeeded (bool increasing_rc_is_needed, ColIndex col) |
| bool | HasCostShift () const |
| bool | StepIsDualDegenerate (bool increasing_rc_is_needed, ColIndex col) |
| void | ClearAndRemoveCostShifts () |
| void | ResetForNewObjective () |
| void | UpdateDataOnBasisPermutation () |
| DenseRow::ConstView | GetReducedCosts () |
| DenseRow::ConstView | GetFullReducedCosts () |
| const DenseColumn & | GetDualValues () |
| std::string | StatString () const |
| Fractional | GetDualFeasibilityTolerance () const |
| bool | IsValidPrimalEnteringCandidate (ColIndex col) const |
| const DenseRow & | GetCostPerturbations () const |
| double | DeterministicTime () const |
| void | AddRecomputationWatcher (bool *watcher) |
◆ ReducedCosts() [1/2]
◆ ReducedCosts() [2/2]
| operations_research::glop::ReducedCosts::ReducedCosts |
( |
const ReducedCosts & | | ) |
|
|
delete |
◆ AddRecomputationWatcher()
| void operations_research::glop::ReducedCosts::AddRecomputationWatcher |
( |
bool * | watcher | ) |
|
|
inline |
◆ AreReducedCostsPrecise()
| bool operations_research::glop::ReducedCosts::AreReducedCostsPrecise |
( |
| ) |
|
|
inline |
◆ AreReducedCostsRecomputed()
| bool operations_research::glop::ReducedCosts::AreReducedCostsRecomputed |
( |
| ) |
|
|
inline |
◆ ClearAndRemoveCostShifts()
| void operations_research::glop::ReducedCosts::ClearAndRemoveCostShifts |
( |
| ) |
|
◆ ComputeMaximumDualInfeasibility()
| Fractional operations_research::glop::ReducedCosts::ComputeMaximumDualInfeasibility |
( |
| ) |
|
◆ ComputeMaximumDualInfeasibilityOnNonBoxedVariables()
| Fractional operations_research::glop::ReducedCosts::ComputeMaximumDualInfeasibilityOnNonBoxedVariables |
( |
| ) |
|
◆ ComputeMaximumDualResidual()
| Fractional operations_research::glop::ReducedCosts::ComputeMaximumDualResidual |
( |
| ) |
|
◆ ComputeSumOfDualInfeasibilities()
| Fractional operations_research::glop::ReducedCosts::ComputeSumOfDualInfeasibilities |
( |
| ) |
|
◆ DeterministicTime()
| double operations_research::glop::ReducedCosts::DeterministicTime |
( |
| ) |
const |
|
inline |
◆ GetCostPerturbations()
| const DenseRow & operations_research::glop::ReducedCosts::GetCostPerturbations |
( |
| ) |
const |
|
inline |
◆ GetDualFeasibilityTolerance()
| Fractional operations_research::glop::ReducedCosts::GetDualFeasibilityTolerance |
( |
| ) |
const |
|
inline |
◆ GetDualValues()
| const DenseColumn & operations_research::glop::ReducedCosts::GetDualValues |
( |
| ) |
|
◆ GetFullReducedCosts()
◆ GetReducedCosts()
◆ HasCostShift()
| bool operations_research::glop::ReducedCosts::HasCostShift |
( |
| ) |
const |
|
inline |
◆ IsValidPrimalEnteringCandidate()
| bool operations_research::glop::ReducedCosts::IsValidPrimalEnteringCandidate |
( |
ColIndex | col | ) |
const |
◆ MakeReducedCostsPrecise()
| void operations_research::glop::ReducedCosts::MakeReducedCostsPrecise |
( |
| ) |
|
◆ NeedsBasisRefactorization()
| bool operations_research::glop::ReducedCosts::NeedsBasisRefactorization |
( |
| ) |
const |
◆ operator=()
◆ PerturbCosts()
| void operations_research::glop::ReducedCosts::PerturbCosts |
( |
| ) |
|
◆ ResetForNewObjective()
| void operations_research::glop::ReducedCosts::ResetForNewObjective |
( |
| ) |
|
◆ SetNonBasicVariableCostToZero()
| void operations_research::glop::ReducedCosts::SetNonBasicVariableCostToZero |
( |
ColIndex | col, |
|
|
Fractional * | current_cost ) |
◆ SetParameters()
| void operations_research::glop::ReducedCosts::SetParameters |
( |
const GlopParameters & | parameters | ) |
|
◆ SetRandom()
| void operations_research::glop::ReducedCosts::SetRandom |
( |
absl::BitGenRef | random | ) |
|
|
inline |
◆ ShiftCostIfNeeded()
| void operations_research::glop::ReducedCosts::ShiftCostIfNeeded |
( |
bool | increasing_rc_is_needed, |
|
|
ColIndex | col ) |
◆ StatString()
| std::string operations_research::glop::ReducedCosts::StatString |
( |
| ) |
const |
|
inline |
◆ StepIsDualDegenerate()
| bool operations_research::glop::ReducedCosts::StepIsDualDegenerate |
( |
bool | increasing_rc_is_needed, |
|
|
ColIndex | col ) |
◆ TestEnteringReducedCostPrecision()
| Fractional operations_research::glop::ReducedCosts::TestEnteringReducedCostPrecision |
( |
ColIndex | entering_col, |
|
|
const ScatteredColumn & | direction ) |
◆ UpdateBeforeBasisPivot()
| void operations_research::glop::ReducedCosts::UpdateBeforeBasisPivot |
( |
ColIndex | entering_col, |
|
|
RowIndex | leaving_row, |
|
|
const ScatteredColumn & | direction, |
|
|
UpdateRow * | update_row ) |
◆ UpdateDataOnBasisPermutation()
| void operations_research::glop::ReducedCosts::UpdateDataOnBasisPermutation |
( |
| ) |
|
The documentation for this class was generated from the following files: