summaryrefslogtreecommitdiff
path: root/thirdparty/linux/include/coin/ClpConstraintAmpl.hpp
blob: 1ca0ab4c2fa0939046cbae5050aa1343f27fa0f6 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
/* $Id: ClpConstraintAmpl.hpp 1899 2013-04-09 18:12:08Z stefan $ */
// 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