ClpPredictorCorrector.hpp

Go to the documentation of this file.

/* $Id: ClpPredictorCorrector.hpp 2385 2019-01-06 19:43:06Z unxusr $ */
// Copyright (C) 2003, International Business Machines
// Corporation and others.  All Rights Reserved.
// This code is licensed under the terms of the Eclipse Public License (EPL).
/*
   Authors

   John Forrest

 */
#ifndef ClpPredictorCorrector_H
#define ClpPredictorCorrector_H

#include "ClpInterior.hpp"

class ClpPredictorCorrector : public ClpInterior {

public:
  int solve();

  //phase  - 0 predictor
  //         1 corrector
  //         2 primal dual
  CoinWorkDouble findStepLength(int phase);
  CoinWorkDouble findDirectionVector(const int phase);
  int createSolution();
  //phase 0=as is , 1 = after predictor , 2 after corrector
  CoinWorkDouble complementarityGap(int &numberComplementarityPairs, int &numberComplementarityItems,
    const int phase);
  //phase 0=affine , 1 = corrector , 2 = primal-dual
  void setupForSolve(const int phase);
  void solveSystem(CoinWorkDouble *region1, CoinWorkDouble *region2,
    const CoinWorkDouble *region1In, const CoinWorkDouble *region2In,
    const CoinWorkDouble *saveRegion1, const CoinWorkDouble *saveRegion2,
    bool gentleRefine);
  bool checkGoodMove(const bool doCorrector, CoinWorkDouble &bestNextGap,
    bool allowIncreasingGap);
  bool checkGoodMove2(CoinWorkDouble move, CoinWorkDouble &bestNextGap,
    bool allowIncreasingGap);
  //returns number fixed
  int updateSolution(CoinWorkDouble nextGap);
  CoinWorkDouble affineProduct();
  void debugMove(int phase, CoinWorkDouble primalStep, CoinWorkDouble dualStep);
};
#endif

/* vi: softtabstop=2 shiftwidth=2 expandtab tabstop=2
*/