casadi 3.6.7__cp313-none-macosx_10_13_x86_64.macosx_10_13_intel.whl

casadi/include/coin/ClpCholeskyPardiso.hpp

@@ -0,0 +1,67 @@
+/* $Id: ClpCholeskyPardiso.hpp 1665 2011-01-04 17:55:54Z lou $ */
+// 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).
+
+#ifndef ClpCholeskyPardiso_H
+#define ClpCholeskyPardiso_H
+#ifdef PARDISO_BARRIER
+
+#include "ClpCholeskyBase.hpp"
+#include "mkl_pardiso.h"
+#include "mkl_types.h"
+
+class ClpMatrixBase;
+class ClpCholeskyDense;
+
+/** Pardiso class for Clp Cholesky factorization
+
+*/
+class ClpCholeskyPardiso : public ClpCholeskyBase {
+
+public:
+  /**@name Virtual methods that the derived classes provides  */
+  //@{
+  /** Orders rows and saves pointer to matrix.and model.
+      Returns non-zero if not enough memory */
+  virtual int order(ClpInterior *model);
+  /** Does Symbolic factorization given permutation.
+         This is called immediately after order.  If user provides this then
+         user must provide factorize and solve.  Otherwise the default factorization is used
+         returns non-zero if not enough memory */
+  virtual int symbolic();
+  /** Factorize - filling in rowsDropped and returning number dropped.
+         If return code negative then out of memory */
+  virtual int factorize(const double *diagonal, int *rowsDropped);
+  /** Uses factorization to solve. */
+  virtual void solve(double *region);
+  //@}
+
+  /**@name Constructors, destructor */
+  //@{
+  /** Constructor which has dense columns activated.
+         Default is off. */
+  ClpCholeskyPardiso(int denseThreshold = -1);
+  /** Destructor  */
+  virtual ~ClpCholeskyPardiso();
+  // Copy
+  ClpCholeskyPardiso(const ClpCholeskyPardiso &);
+  // Assignment
+  ClpCholeskyPardiso &operator=(const ClpCholeskyPardiso &);
+  /// Clone
+  virtual ClpCholeskyBase *clone() const;
+  //@}
+
+private:
+  /**@name Data members */
+  //@{
+  int lastNumberDropped_;
+  //MKL_INT iparm_[64];
+  //@}
+};
+
+#endif
+#endif
+
+/* vi: softtabstop=2 shiftwidth=2 expandtab tabstop=2
+*/

casadi/include/coin/ClpConfig.h

@@ -0,0 +1,17 @@
+/* src/config_clp.h.  Generated by configure.  */
+/* src/config_clp.h.in.  */
+
+/* Define to 1, 2, 3, or 4 if Aboca should be build. */
+/* #undef CLP_HAS_ABC */
+
+/* Version number of project */
+#define CLP_VERSION "1.17.9"
+
+/* Major Version number of project */
+#define CLP_VERSION_MAJOR 1
+
+/* Minor Version number of project */
+#define CLP_VERSION_MINOR 17
+
+/* Release Version number of project */
+#define CLP_VERSION_RELEASE 9

casadi/include/coin/ClpConstraint.hpp

@@ -0,0 +1,129 @@
+/* $Id$ */
+// Copyright (C) 2007, International Business Machines
+// Corporation and others.  All Rights Reserved.
+// This code is licensed under the terms of the Eclipse Public License (EPL).
+
+#ifndef ClpConstraint_H
+#define ClpConstraint_H
+
+//#############################################################################
+class ClpSimplex;
+class ClpModel;
+
+/** Constraint Abstract Base Class
+
+Abstract Base Class for describing a constraint or objective function
+
+*/
+class ClpConstraint {
+
+public:
+  ///@name Stuff
+  //@{
+
+  /** Fills gradient.  If Linear then solution may be NULL,
+         also returns true value of function and offset so we can use x not deltaX in constraint
+         If refresh is false then uses last solution
+         Uses model for scaling
+         Returns non-zero if gradient undefined at current solution
+     */
+  virtual int gradient(const ClpSimplex *model,
+    const double *solution,
+    double *gradient,
+    double &functionValue,
+    double &offset,
+    bool useScaling = false,
+    bool refresh = true) const = 0;
+  /// Constraint function value
+  virtual double functionValue(const ClpSimplex *model,
+    const double *solution,
+    bool useScaling = false,
+    bool refresh = true) const;
+  /// Resize constraint
+  virtual void resize(int newNumberColumns) = 0;
+  /// Delete columns in  constraint
+  virtual void deleteSome(int numberToDelete, const int *which) = 0;
+  /// Scale constraint
+  virtual void reallyScale(const double *columnScale) = 0;
+  /** Given a zeroed array sets nonlinear columns to 1.
+         Returns number of nonlinear columns
+      */
+  virtual int markNonlinear(char *which) const = 0;
+  /** Given a zeroed array sets possible nonzero coefficients to 1.
+         Returns number of nonzeros
+      */
+  virtual int markNonzero(char *which) const = 0;
+  //@}
+
+  ///@name Constructors and destructors
+  //@{
+  /// Default Constructor
+  ClpConstraint();
+
+  /// Copy constructor
+  ClpConstraint(const ClpConstraint &);
+
+  /// Assignment operator
+  ClpConstraint &operator=(const ClpConstraint &rhs);
+
+  /// Destructor
+  virtual ~ClpConstraint();
+
+  /// Clone
+  virtual ClpConstraint *clone() const = 0;
+
+  //@}
+
+  ///@name Other
+  //@{
+  /// Returns type, 0 linear, 1 nonlinear
+  inline int type()
+  {
+    return type_;
+  }
+  /// Row number (-1 is objective)
+  inline int rowNumber() const
+  {
+    return rowNumber_;
+  }
+
+  /// Number of possible coefficients in gradient
+  virtual int numberCoefficients() const = 0;
+
+  /// Stored constraint function value
+  inline double functionValue() const
+  {
+    return functionValue_;
+  }
+
+  /// Constraint offset
+  inline double offset() const
+  {
+    return offset_;
+  }
+  /// Say we have new primal solution - so may need to recompute
+  virtual void newXValues() {}
+  //@}
+
+  //---------------------------------------------------------------------------
+
+protected:
+  ///@name Protected member data
+  //@{
+  /// Gradient at last evaluation
+  mutable double *lastGradient_;
+  /// Value of non-linear part of constraint
+  mutable double functionValue_;
+  /// Value of offset for constraint
+  mutable double offset_;
+  /// Type of constraint - linear is 1
+  int type_;
+  /// Row number (-1 is objective)
+  int rowNumber_;
+  //@}
+};
+
+#endif
+
+/* vi: softtabstop=2 shiftwidth=2 expandtab tabstop=2
+*/

casadi/include/coin/ClpConstraintAmpl.hpp

@@ -0,0 +1,109 @@
+/* $Id$ */
+// Copyright (C) 2007, International Business Machines
+// Corporation and others.  All Rights Reserved.
+// This code is licensed under the terms of the Eclipse Public License (EPL).
+
+#ifndef ClpConstraintAmpl_H
+#define ClpConstraintAmpl_H
+
+#include "ClpConstraint.hpp"
+
+//#############################################################################
+
+/** Ampl Constraint Class
+
+*/
+
+class ClpConstraintAmpl : public ClpConstraint {
+
+public:
+  ///@name Stuff
+  //@{
+
+  /** Fills gradient.  If Ampl then solution may be NULL,
+        also returns true value of function and offset so we can use x not deltaX in constraint
+        If refresh is false then uses last solution
+        Uses model for scaling
+        Returns non-zero if gradient udefined at current solution
+    */
+  virtual int gradient(const ClpSimplex *model,
+    const double *solution,
+    double *gradient,
+    double &functionValue,
+    double &offset,
+    bool useScaling = false,
+    bool refresh = true) const;
+  /// Resize constraint
+  virtual void resize(int newNumberColumns);
+  /// Delete columns in  constraint
+  virtual void deleteSome(int numberToDelete, const int *which);
+  /// Scale constraint
+  virtual void reallyScale(const double *columnScale);
+  /** Given a zeroed array sets nonampl columns to 1.
+        Returns number of nonampl columns
+     */
+  virtual int markNonlinear(char *which) const;
+  /** Given a zeroed array sets possible nonzero coefficients to 1.
+        Returns number of nonzeros
+     */
+  virtual int markNonzero(char *which) const;
+  /// Say we have new primal solution - so may need to recompute
+  virtual void newXValues();
+  //@}
+
+  ///@name Constructors and destructors
+  //@{
+  /// Default Constructor
+  ClpConstraintAmpl();
+
+  /// Constructor from ampl
+  ClpConstraintAmpl(int row, void *amplInfo);
+
+  /** Copy constructor .
+    */
+  ClpConstraintAmpl(const ClpConstraintAmpl &rhs);
+
+  /// Assignment operator
+  ClpConstraintAmpl &operator=(const ClpConstraintAmpl &rhs);
+
+  /// Destructor
+  virtual ~ClpConstraintAmpl();
+
+  /// Clone
+  virtual ClpConstraint *clone() const;
+  //@}
+  ///@name Gets and sets
+  //@{
+  /// Number of coefficients
+  virtual int numberCoefficients() const;
+  /// Columns
+  inline const int *column() const
+  {
+    return column_;
+  }
+  /// Coefficients
+  inline const double *coefficient() const
+  {
+    return coefficient_;
+  }
+  //@}
+
+  //---------------------------------------------------------------------------
+
+private:
+  ///@name Private member data
+  /// Ampl info
+  void *amplInfo_;
+  /// Column
+  int *column_;
+  /// Coefficients
+  double *coefficient_;
+  /// Number of coefficients in gradient
+  int numberCoefficients_;
+  //@}
+};
+
+#endif
+
+/* vi: softtabstop=2 shiftwidth=2 expandtab tabstop=2
+*/

casadi/include/coin/ClpConstraintLinear.hpp

@@ -0,0 +1,113 @@
+/* $Id$ */
+// Copyright (C) 2007, International Business Machines
+// Corporation and others.  All Rights Reserved.
+// This code is licensed under the terms of the Eclipse Public License (EPL).
+
+#ifndef ClpConstraintLinear_H
+#define ClpConstraintLinear_H
+
+#include "ClpConstraint.hpp"
+
+//#############################################################################
+
+/** Linear Constraint Class
+
+*/
+
+class ClpConstraintLinear : public ClpConstraint {
+
+public:
+  ///@name Stuff
+  //@{
+
+  /** Fills gradient.  If Linear then solution may be NULL,
+         also returns true value of function and offset so we can use x not deltaX in constraint
+         If refresh is false then uses last solution
+         Uses model for scaling
+         Returns non-zero if gradient udefined at current solution
+     */
+  virtual int gradient(const ClpSimplex *model,
+    const double *solution,
+    double *gradient,
+    double &functionValue,
+    double &offset,
+    bool useScaling = false,
+    bool refresh = true) const;
+  /// Resize constraint
+  virtual void resize(int newNumberColumns);
+  /// Delete columns in  constraint
+  virtual void deleteSome(int numberToDelete, const int *which);
+  /// Scale constraint
+  virtual void reallyScale(const double *columnScale);
+  /** Given a zeroed array sets nonlinear columns to 1.
+         Returns number of nonlinear columns
+      */
+  virtual int markNonlinear(char *which) const;
+  /** Given a zeroed array sets possible nonzero coefficients to 1.
+         Returns number of nonzeros
+      */
+  virtual int markNonzero(char *which) const;
+  //@}
+
+  ///@name Constructors and destructors
+  //@{
+  /// Default Constructor
+  ClpConstraintLinear();
+
+  /// Constructor from constraint
+  ClpConstraintLinear(int row, int numberCoefficients, int numberColumns,
+    const int *column, const double *element);
+
+  /** Copy constructor .
+     */
+  ClpConstraintLinear(const ClpConstraintLinear &rhs);
+
+  /// Assignment operator
+  ClpConstraintLinear &operator=(const ClpConstraintLinear &rhs);
+
+  /// Destructor
+  virtual ~ClpConstraintLinear();
+
+  /// Clone
+  virtual ClpConstraint *clone() const;
+  //@}
+  ///@name Gets and sets
+  //@{
+  /// Number of coefficients
+  virtual int numberCoefficients() const;
+  /// Number of columns in linear constraint
+  inline int numberColumns() const
+  {
+    return numberColumns_;
+  }
+  /// Columns
+  inline const int *column() const
+  {
+    return column_;
+  }
+  /// Coefficients
+  inline const double *coefficient() const
+  {
+    return coefficient_;
+  }
+  //@}
+
+  //---------------------------------------------------------------------------
+
+private:
+  ///@name Private member data
+  /// Column
+  int *column_;
+  /// Coefficients
+  double *coefficient_;
+  /// Useful to have number of columns about
+  int numberColumns_;
+  /// Number of coefficients
+  int numberCoefficients_;
+  //@}
+};
+
+#endif
+
+/* vi: softtabstop=2 shiftwidth=2 expandtab tabstop=2
+*/

casadi/include/coin/ClpConstraintQuadratic.hpp

@@ -0,0 +1,123 @@
+/* $Id$ */
+// Copyright (C) 2007, International Business Machines
+// Corporation and others.  All Rights Reserved.
+// This code is licensed under the terms of the Eclipse Public License (EPL).
+
+#ifndef ClpConstraintQuadratic_H
+#define ClpConstraintQuadratic_H
+
+#include "ClpConstraint.hpp"
+
+//#############################################################################
+
+/** Quadratic Constraint Class
+
+*/
+
+class ClpConstraintQuadratic : public ClpConstraint {
+
+public:
+  ///@name Stuff
+  //@{
+
+  /** Fills gradient.  If Quadratic then solution may be NULL,
+         also returns true value of function and offset so we can use x not deltaX in constraint
+         If refresh is false then uses last solution
+         Uses model for scaling
+         Returns non-zero if gradient udefined at current solution
+     */
+  virtual int gradient(const ClpSimplex *model,
+    const double *solution,
+    double *gradient,
+    double &functionValue,
+    double &offset,
+    bool useScaling = false,
+    bool refresh = true) const;
+  /// Resize constraint
+  virtual void resize(int newNumberColumns);
+  /// Delete columns in  constraint
+  virtual void deleteSome(int numberToDelete, const int *which);
+  /// Scale constraint
+  virtual void reallyScale(const double *columnScale);
+  /** Given a zeroed array sets nonquadratic columns to 1.
+         Returns number of nonquadratic columns
+      */
+  virtual int markNonlinear(char *which) const;
+  /** Given a zeroed array sets possible nonzero coefficients to 1.
+         Returns number of nonzeros
+      */
+  virtual int markNonzero(char *which) const;
+  //@}
+
+  ///@name Constructors and destructors
+  //@{
+  /// Default Constructor
+  ClpConstraintQuadratic();
+
+  /// Constructor from quadratic
+  ClpConstraintQuadratic(int row, int numberQuadraticColumns, int numberColumns,
+    const CoinBigIndex *start,
+    const int *column, const double *element);
+
+  /** Copy constructor .
+     */
+  ClpConstraintQuadratic(const ClpConstraintQuadratic &rhs);
+
+  /// Assignment operator
+  ClpConstraintQuadratic &operator=(const ClpConstraintQuadratic &rhs);
+
+  /// Destructor
+  virtual ~ClpConstraintQuadratic();
+
+  /// Clone
+  virtual ClpConstraint *clone() const;
+  //@}
+  ///@name Gets and sets
+  //@{
+  /// Number of coefficients
+  virtual int numberCoefficients() const;
+  /// Number of columns in constraint
+  inline int numberColumns() const
+  {
+    return numberColumns_;
+  }
+  /// Column starts
+  inline CoinBigIndex *start() const
+  {
+    return start_;
+  }
+  /// Columns
+  inline const int *column() const
+  {
+    return column_;
+  }
+  /// Coefficients
+  inline const double *coefficient() const
+  {
+    return coefficient_;
+  }
+  //@}
+
+  //---------------------------------------------------------------------------
+
+private:
+  ///@name Private member data
+  /// Column starts
+  CoinBigIndex *start_;
+  /// Column (if -1 then linear coefficient)
+  int *column_;
+  /// Coefficients
+  double *coefficient_;
+  /// Useful to have number of columns about
+  int numberColumns_;
+  /// Number of coefficients in gradient
+  int numberCoefficients_;
+  /// Number of quadratic columns
+  int numberQuadraticColumns_;
+  //@}
+};
+
+#endif
+
+/* vi: softtabstop=2 shiftwidth=2 expandtab tabstop=2
+*/

casadi/include/coin/ClpDualRowDantzig.hpp

@@ -0,0 +1,72 @@
+/* $Id$ */
+// 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).
+
+#ifndef ClpDualRowDantzig_H
+#define ClpDualRowDantzig_H
+
+#include "ClpDualRowPivot.hpp"
+
+//#############################################################################
+
+/** Dual Row Pivot Dantzig Algorithm Class
+
+This is simplest choice - choose largest infeasibility
+
+*/
+
+class ClpDualRowDantzig : public ClpDualRowPivot {
+
+public:
+  ///@name Algorithmic methods
+  //@{
+
+  /// Returns pivot row, -1 if none
+  virtual int pivotRow();
+
+  /** Updates weights and returns pivot alpha.
+         Also does FT update */
+  virtual double updateWeights(CoinIndexedVector *input,
+    CoinIndexedVector *spare,
+    CoinIndexedVector *spare2,
+    CoinIndexedVector *updatedColumn);
+  /** Updates primal solution (and maybe list of candidates)
+         Uses input vector which it deletes
+         Computes change in objective function
+     */
+  virtual void updatePrimalSolution(CoinIndexedVector *input,
+    double theta,
+    double &changeInObjective);
+  //@}
+
+  ///@name Constructors and destructors
+  //@{
+  /// Default Constructor
+  ClpDualRowDantzig();
+
+  /// Copy constructor
+  ClpDualRowDantzig(const ClpDualRowDantzig &);
+
+  /// Assignment operator
+  ClpDualRowDantzig &operator=(const ClpDualRowDantzig &rhs);
+
+  /// Destructor
+  virtual ~ClpDualRowDantzig();
+
+  /// Clone
+  virtual ClpDualRowPivot *clone(bool copyData = true) const;
+
+  //@}
+
+  //---------------------------------------------------------------------------
+
+private:
+  ///@name Private member data
+  //@}
+};
+
+#endif
+
+/* vi: softtabstop=2 shiftwidth=2 expandtab tabstop=2
+*/