ClpSimplexPrimal.hpp

Go to the documentation of this file.

/* $Id: ClpSimplexPrimal.hpp 2385 2019-01-06 19:43:06Z unxusr $ */
// Copyright (C) 2002, 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 ClpSimplexPrimal_H
#define ClpSimplexPrimal_H

#include "ClpSimplex.hpp"

class ClpSimplexPrimal : public ClpSimplex {

public:
  int primal(int ifValuesPass = 0, int startFinishOptions = 0);

  void alwaysOptimal(bool onOff);
  bool alwaysOptimal() const;
  void exactOutgoing(bool onOff);
  bool exactOutgoing() const;

  int whileIterating(int valuesOption);

  int pivotResult(int ifValuesPass = 0);

  int updatePrimalsInPrimal(CoinIndexedVector *rowArray,
    double theta,
    double &objectiveChange,
    int valuesPass);
  void primalRow(CoinIndexedVector *rowArray,
    CoinIndexedVector *rhsArray,
    CoinIndexedVector *spareArray,
    int valuesPass);
  void primalColumn(CoinIndexedVector *updateArray,
    CoinIndexedVector *spareRow1,
    CoinIndexedVector *spareRow2,
    CoinIndexedVector *spareColumn1,
    CoinIndexedVector *spareColumn2);

  int checkUnbounded(CoinIndexedVector *ray, CoinIndexedVector *spare,
    double changeCost);
  void statusOfProblemInPrimal(int &lastCleaned, int type,
    ClpSimplexProgress *progress,
    bool doFactorization,
    int ifValuesPass,
    ClpSimplex *saveModel = NULL);
  void perturb(int type);
  bool unPerturb();
  int unflag();
  int nextSuperBasic(int superBasicType, CoinIndexedVector *columnArray);

  void primalRay(CoinIndexedVector *rowArray);
  void clearAll();

  int lexSolve();

};
#endif

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