AbcSimplexPrimal.hpp

Go to the documentation of this file.

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

   John Forrest

 */
#ifndef AbcSimplexPrimal_H
#define AbcSimplexPrimal_H

#include "AbcSimplex.hpp"

class AbcSimplexPrimal : public AbcSimplex {

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 pivotResult4(int ifValuesPass = 0);

  int updatePrimalsInPrimal(CoinIndexedVector *rowArray,
    double theta,
    double &objectiveChange,
    int valuesPass);
  void updatePrimalsInPrimal(CoinIndexedVector &rowArray,
    double theta, bool valuesPass);
  void createUpdateDuals(CoinIndexedVector &rowArray,
    const double *originalCost,
    const double extraCost[4],
    double &objectiveChange,
    int valuesPass);
  double updateMinorCandidate(const CoinIndexedVector &updateBy,
    CoinIndexedVector &candidate,
    int sequenceIn);
  void updatePartialUpdate(CoinIndexedVector &partialUpdate);
  int doFTUpdate(CoinIndexedVector *vector[4]);
  void primalRow(CoinIndexedVector *rowArray,
    CoinIndexedVector *rhsArray,
    CoinIndexedVector *spareArray,
    int valuesPass);
  typedef struct {
    double theta_;
    double alpha_;
    double saveDualIn_;
    double dualIn_;
    double lowerIn_;
    double upperIn_;
    double valueIn_;
    int sequenceIn_;
    int directionIn_;
    double dualOut_;
    double lowerOut_;
    double upperOut_;
    double valueOut_;
    int sequenceOut_;
    int directionOut_;
    int pivotRow_;
    int valuesPass_;
  } pivotStruct;
  void primalRow(CoinIndexedVector *rowArray,
    CoinIndexedVector *rhsArray,
    CoinIndexedVector *spareArray,
    pivotStruct &stuff);
  void primalColumn(CoinPartitionedVector *updateArray,
    CoinPartitionedVector *spareRow2,
    CoinPartitionedVector *spareColumn1);

  int checkUnbounded(CoinIndexedVector *ray, CoinIndexedVector *spare,
    double changeCost);
  void statusOfProblemInPrimal(int type);
  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
*/